./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005.opt.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/mix005.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --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:40:18,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:40:18,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:40:18,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:40:18,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:40:18,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:40:18,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:40:18,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:40:18,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:40:18,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:40:18,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:40:18,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:40:18,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:40:18,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:40:18,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:40:18,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:40:18,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:40:18,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:40:18,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:40:18,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:40:18,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:40:18,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:40:18,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:40:18,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:40:18,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:40:18,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:40:18,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:40:18,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:40:18,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:40:18,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:40:18,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:40:18,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:40:18,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:40:18,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:40:18,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:40:18,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:40:18,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:40:18,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:40:18,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:40:18,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:40:18,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:40:18,965 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:40:18,997 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:40:18,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:40:18,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:40:18,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:40:19,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:40:19,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:40:19,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:40:19,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:40:19,001 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:40:19,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:40:19,002 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:40:19,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:40:19,003 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:40:19,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:40:19,004 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:40:19,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:40:19,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:40:19,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:40:19,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:40:19,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:40:19,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:40:19,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:40:19,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:40:19,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:40:19,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:40:19,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:40:19,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:40:19,007 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:40:19,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:40:19,007 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:40:19,007 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 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:40:19,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:40:19,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:40:19,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:40:19,340 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:40:19,341 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:40:19,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005.opt.i [2023-08-30 16:40:20,538 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:40:20,781 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:40:20,781 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005.opt.i [2023-08-30 16:40:20,792 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6507e1b5/99a0e6ab58774084ac3ec3a421f42a79/FLAG28d223b9b [2023-08-30 16:40:20,807 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6507e1b5/99a0e6ab58774084ac3ec3a421f42a79 [2023-08-30 16:40:20,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:40:20,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:40:20,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:40:20,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:40:20,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:40:20,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:40:20" (1/1) ... [2023-08-30 16:40:20,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c324b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:20, skipping insertion in model container [2023-08-30 16:40:20,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:40:20" (1/1) ... [2023-08-30 16:40:20,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:40:20,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:40:21,005 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/mix005.opt.i[944,957] [2023-08-30 16:40:21,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:40:21,239 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:40:21,251 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/mix005.opt.i[944,957] [2023-08-30 16:40:21,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:40:21,366 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:40:21,367 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:40:21,373 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:40:21,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21 WrapperNode [2023-08-30 16:40:21,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:40:21,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:40:21,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:40:21,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:40:21,382 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:40:21" (1/1) ... [2023-08-30 16:40:21,415 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:40:21" (1/1) ... [2023-08-30 16:40:21,457 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-30 16:40:21,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:40:21,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:40:21,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:40:21,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:40:21,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:40:21,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:40:21,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:40:21,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:40:21,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (1/1) ... [2023-08-30 16:40:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:40:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:40:21,558 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:40:21,585 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:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:40:21,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:40:21,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:40:21,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:40:21,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:40:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:40:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:40:21,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:40:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:40:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:40:21,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:40:21,604 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:40:21,736 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:40:21,738 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:40:22,149 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:40:22,283 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:40:22,283 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:40:22,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:40:22 BoogieIcfgContainer [2023-08-30 16:40:22,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:40:22,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:40:22,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:40:22,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:40:22,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:40:20" (1/3) ... [2023-08-30 16:40:22,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101c767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:40:22, skipping insertion in model container [2023-08-30 16:40:22,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:40:21" (2/3) ... [2023-08-30 16:40:22,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101c767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:40:22, skipping insertion in model container [2023-08-30 16:40:22,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:40:22" (3/3) ... [2023-08-30 16:40:22,293 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2023-08-30 16:40:22,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:40:22,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:40:22,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:40:22,309 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:40:22,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:40:22,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:40:22,457 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:40:22,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:40:22,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:40:22,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:40:22,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 16:40:22,473 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:40:22,484 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:40:22,486 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:40:22,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 16:40:22,514 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:40:22,515 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:40:22,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:40:22,517 INFO L119 LiptonReduction]: Number of co-enabled transitions 2836 [2023-08-30 16:40:26,296 INFO L134 LiptonReduction]: Checked pairs total: 7239 [2023-08-30 16:40:26,297 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-30 16:40:26,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:40:26,314 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;@3378c3a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:40:26,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:40:26,319 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 16:40:26,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:40:26,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:26,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:26,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:26,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 450265245, now seen corresponding path program 1 times [2023-08-30 16:40:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068757681] [2023-08-30 16:40:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:26,747 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:40:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068757681] [2023-08-30 16:40:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068757681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:26,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:26,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:40:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270262812] [2023-08-30 16:40:26,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:26,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:40:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:40:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:40:26,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 238 [2023-08-30 16:40:26,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:40:26,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:26,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 238 [2023-08-30 16:40:26,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:27,451 INFO L130 PetriNetUnfolder]: 3113/4519 cut-off events. [2023-08-30 16:40:27,452 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-30 16:40:27,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8913 conditions, 4519 events. 3113/4519 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24114 event pairs, 593 based on Foata normal form. 0/4326 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-08-30 16:40:27,483 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-08-30 16:40:27,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2023-08-30 16:40:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:40:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:40:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-30 16:40:27,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.542016806722689 [2023-08-30 16:40:27,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-30 16:40:27,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-30 16:40:27,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:27,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-30 16:40:27,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:40:27,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:40:27,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:40:27,517 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 387 transitions. [2023-08-30 16:40:27,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2023-08-30 16:40:27,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:40:27,524 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-30 16:40:27,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:40:27,528 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:40:27,530 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-30 16:40:27,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:40:27,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:27,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:40:27,534 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:27,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 671305977, now seen corresponding path program 1 times [2023-08-30 16:40:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:27,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848564217] [2023-08-30 16:40:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:27,934 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:40:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848564217] [2023-08-30 16:40:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848564217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:40:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583136483] [2023-08-30 16:40:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:27,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:40:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:27,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:40:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:40:27,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 16:40:27,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:27,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:27,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 16:40:27,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:29,638 INFO L130 PetriNetUnfolder]: 12061/16586 cut-off events. [2023-08-30 16:40:29,638 INFO L131 PetriNetUnfolder]: For 636/636 co-relation queries the response was YES. [2023-08-30 16:40:29,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34142 conditions, 16586 events. 12061/16586 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 86504 event pairs, 4277 based on Foata normal form. 712/17298 useless extension candidates. Maximal degree in co-relation 34132. Up to 10573 conditions per place. [2023-08-30 16:40:29,730 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 41 selfloop transitions, 8 changer transitions 31/80 dead transitions. [2023-08-30 16:40:29,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 342 flow [2023-08-30 16:40:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:40:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:40:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-30 16:40:29,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100840336134453 [2023-08-30 16:40:29,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-30 16:40:29,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-30 16:40:29,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:29,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-30 16:40:29,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 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:40:29,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:29,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:29,739 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 607 transitions. [2023-08-30 16:40:29,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 342 flow [2023-08-30 16:40:29,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:40:29,751 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 142 flow [2023-08-30 16:40:29,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-30 16:40:29,752 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-30 16:40:29,752 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 142 flow [2023-08-30 16:40:29,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:29,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:29,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:29,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:40:29,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:29,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -664401429, now seen corresponding path program 1 times [2023-08-30 16:40:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:29,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000336870] [2023-08-30 16:40:29,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:29,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:29,943 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:40:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000336870] [2023-08-30 16:40:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000336870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:40:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169662727] [2023-08-30 16:40:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:29,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:29,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:29,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 16:40:29,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:40:29,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:29,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 16:40:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:31,416 INFO L130 PetriNetUnfolder]: 10253/14198 cut-off events. [2023-08-30 16:40:31,416 INFO L131 PetriNetUnfolder]: For 9641/9641 co-relation queries the response was YES. [2023-08-30 16:40:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40590 conditions, 14198 events. 10253/14198 cut-off events. For 9641/9641 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 73039 event pairs, 2525 based on Foata normal form. 660/14858 useless extension candidates. Maximal degree in co-relation 40576. Up to 6737 conditions per place. [2023-08-30 16:40:31,506 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 55 selfloop transitions, 9 changer transitions 43/107 dead transitions. [2023-08-30 16:40:31,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 107 transitions, 636 flow [2023-08-30 16:40:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:40:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:40:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-30 16:40:31,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006002400960384 [2023-08-30 16:40:31,510 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-30 16:40:31,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-30 16:40:31,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:31,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-30 16:40:31,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 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:40:31,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:31,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:31,516 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 142 flow. Second operand 7 states and 834 transitions. [2023-08-30 16:40:31,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 107 transitions, 636 flow [2023-08-30 16:40:31,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 107 transitions, 582 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:40:31,674 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 208 flow [2023-08-30 16:40:31,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-30 16:40:31,675 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-30 16:40:31,675 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 208 flow [2023-08-30 16:40:31,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:40:31,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:31,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:31,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:40:31,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:31,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -772538425, now seen corresponding path program 1 times [2023-08-30 16:40:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:31,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066263995] [2023-08-30 16:40:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:31,925 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:40:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066263995] [2023-08-30 16:40:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066263995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:40:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980359666] [2023-08-30 16:40:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:31,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:31,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:31,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 16:40:31,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:40:31,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:31,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 16:40:31,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:33,222 INFO L130 PetriNetUnfolder]: 8833/12262 cut-off events. [2023-08-30 16:40:33,222 INFO L131 PetriNetUnfolder]: For 19522/19522 co-relation queries the response was YES. [2023-08-30 16:40:33,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38186 conditions, 12262 events. 8833/12262 cut-off events. For 19522/19522 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 60054 event pairs, 2181 based on Foata normal form. 432/12694 useless extension candidates. Maximal degree in co-relation 38166. Up to 5845 conditions per place. [2023-08-30 16:40:33,302 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 53 selfloop transitions, 14 changer transitions 35/102 dead transitions. [2023-08-30 16:40:33,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 102 transitions, 710 flow [2023-08-30 16:40:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:40:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:40:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-30 16:40:33,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49339735894357745 [2023-08-30 16:40:33,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-30 16:40:33,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-30 16:40:33,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:33,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-30 16:40:33,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:40:33,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:33,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:33,312 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 208 flow. Second operand 7 states and 822 transitions. [2023-08-30 16:40:33,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 102 transitions, 710 flow [2023-08-30 16:40:33,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 102 transitions, 691 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-30 16:40:33,394 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 348 flow [2023-08-30 16:40:33,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-30 16:40:33,395 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-30 16:40:33,395 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 348 flow [2023-08-30 16:40:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:40:33,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:33,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:33,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:40:33,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:33,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -467340547, now seen corresponding path program 1 times [2023-08-30 16:40:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719089151] [2023-08-30 16:40:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:40:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719089151] [2023-08-30 16:40:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719089151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:40:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115380673] [2023-08-30 16:40:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:33,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 16:40:33,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:40:33,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:33,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 16:40:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:34,592 INFO L130 PetriNetUnfolder]: 8176/11363 cut-off events. [2023-08-30 16:40:34,593 INFO L131 PetriNetUnfolder]: For 24850/24850 co-relation queries the response was YES. [2023-08-30 16:40:34,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38943 conditions, 11363 events. 8176/11363 cut-off events. For 24850/24850 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 56210 event pairs, 2157 based on Foata normal form. 286/11649 useless extension candidates. Maximal degree in co-relation 38918. Up to 7299 conditions per place. [2023-08-30 16:40:34,672 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 59 selfloop transitions, 27 changer transitions 29/115 dead transitions. [2023-08-30 16:40:34,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 115 transitions, 908 flow [2023-08-30 16:40:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:40:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:40:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-30 16:40:34,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006002400960384 [2023-08-30 16:40:34,688 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-30 16:40:34,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-30 16:40:34,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:34,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-30 16:40:34,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 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:40:34,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:34,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:34,693 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 348 flow. Second operand 7 states and 834 transitions. [2023-08-30 16:40:34,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 115 transitions, 908 flow [2023-08-30 16:40:34,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 868 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-30 16:40:34,787 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 489 flow [2023-08-30 16:40:34,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-08-30 16:40:34,789 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-08-30 16:40:34,790 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 489 flow [2023-08-30 16:40:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:40:34,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:34,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:40:34,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:34,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2128802627, now seen corresponding path program 1 times [2023-08-30 16:40:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046461381] [2023-08-30 16:40:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:34,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:35,049 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:40:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046461381] [2023-08-30 16:40:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046461381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:35,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:40:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005840790] [2023-08-30 16:40:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:35,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:40:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:40:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:40:35,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-08-30 16:40:35,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:40:35,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:35,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-08-30 16:40:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:35,826 INFO L130 PetriNetUnfolder]: 5059/7514 cut-off events. [2023-08-30 16:40:35,827 INFO L131 PetriNetUnfolder]: For 19540/21544 co-relation queries the response was YES. [2023-08-30 16:40:35,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25330 conditions, 7514 events. 5059/7514 cut-off events. For 19540/21544 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 44110 event pairs, 1007 based on Foata normal form. 821/7968 useless extension candidates. Maximal degree in co-relation 25302. Up to 4930 conditions per place. [2023-08-30 16:40:35,877 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 93 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2023-08-30 16:40:35,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 123 transitions, 1217 flow [2023-08-30 16:40:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:40:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:40:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2023-08-30 16:40:35,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2023-08-30 16:40:35,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2023-08-30 16:40:35,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2023-08-30 16:40:35,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:35,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2023-08-30 16:40:35,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 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:40:35,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:35,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:35,884 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 489 flow. Second operand 5 states and 620 transitions. [2023-08-30 16:40:35,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 123 transitions, 1217 flow [2023-08-30 16:40:35,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 1181 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-30 16:40:35,925 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 546 flow [2023-08-30 16:40:35,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-30 16:40:35,926 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-08-30 16:40:35,926 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 546 flow [2023-08-30 16:40:35,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:40:35,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:35,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:35,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:40:35,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:35,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -988833164, now seen corresponding path program 1 times [2023-08-30 16:40:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783752140] [2023-08-30 16:40:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:36,109 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:40:36,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783752140] [2023-08-30 16:40:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783752140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:36,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:36,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:40:36,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87517381] [2023-08-30 16:40:36,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:36,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:36,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 16:40:36,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 546 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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:40:36,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:36,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 16:40:36,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:37,198 INFO L130 PetriNetUnfolder]: 8657/12522 cut-off events. [2023-08-30 16:40:37,198 INFO L131 PetriNetUnfolder]: For 38460/38460 co-relation queries the response was YES. [2023-08-30 16:40:37,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53894 conditions, 12522 events. 8657/12522 cut-off events. For 38460/38460 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 68614 event pairs, 2634 based on Foata normal form. 132/12654 useless extension candidates. Maximal degree in co-relation 53866. Up to 6236 conditions per place. [2023-08-30 16:40:37,240 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 69 selfloop transitions, 14 changer transitions 36/119 dead transitions. [2023-08-30 16:40:37,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 1062 flow [2023-08-30 16:40:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:40:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:40:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2023-08-30 16:40:37,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49789915966386555 [2023-08-30 16:40:37,244 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2023-08-30 16:40:37,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2023-08-30 16:40:37,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:37,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2023-08-30 16:40:37,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 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:40:37,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:40:37,249 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:40:37,249 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 546 flow. Second operand 6 states and 711 transitions. [2023-08-30 16:40:37,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 1062 flow [2023-08-30 16:40:37,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:40:37,318 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 481 flow [2023-08-30 16:40:37,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2023-08-30 16:40:37,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-30 16:40:37,319 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 481 flow [2023-08-30 16:40:37,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 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:40:37,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:37,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:37,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:40:37,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:37,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash 161396394, now seen corresponding path program 1 times [2023-08-30 16:40:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004061891] [2023-08-30 16:40:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:37,517 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:40:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004061891] [2023-08-30 16:40:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004061891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:40:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613538527] [2023-08-30 16:40:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:37,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:40:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:40:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:40:37,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 16:40:37,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 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:40:37,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:37,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 16:40:37,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:38,433 INFO L130 PetriNetUnfolder]: 6965/10314 cut-off events. [2023-08-30 16:40:38,433 INFO L131 PetriNetUnfolder]: For 35872/35872 co-relation queries the response was YES. [2023-08-30 16:40:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44036 conditions, 10314 events. 6965/10314 cut-off events. For 35872/35872 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 58491 event pairs, 766 based on Foata normal form. 144/10458 useless extension candidates. Maximal degree in co-relation 44004. Up to 4747 conditions per place. [2023-08-30 16:40:38,484 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 88 selfloop transitions, 31 changer transitions 24/143 dead transitions. [2023-08-30 16:40:38,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 1337 flow [2023-08-30 16:40:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:40:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:40:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-30 16:40:38,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957983193277311 [2023-08-30 16:40:38,487 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-30 16:40:38,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-30 16:40:38,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:38,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-30 16:40:38,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 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:40:38,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:38,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:40:38,493 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 481 flow. Second operand 7 states and 826 transitions. [2023-08-30 16:40:38,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 1337 flow [2023-08-30 16:40:38,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1223 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-30 16:40:38,630 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 666 flow [2023-08-30 16:40:38,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=666, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-08-30 16:40:38,631 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-30 16:40:38,631 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 666 flow [2023-08-30 16:40:38,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 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:40:38,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:38,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:38,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:40:38,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:38,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash 865871138, now seen corresponding path program 2 times [2023-08-30 16:40:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463104500] [2023-08-30 16:40:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:40:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463104500] [2023-08-30 16:40:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463104500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:40:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95026582] [2023-08-30 16:40:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:38,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:38,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-08-30 16:40:38,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 666 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 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:40:38,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:38,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-08-30 16:40:38,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:39,540 INFO L130 PetriNetUnfolder]: 3785/6106 cut-off events. [2023-08-30 16:40:39,540 INFO L131 PetriNetUnfolder]: For 16021/16838 co-relation queries the response was YES. [2023-08-30 16:40:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 6106 events. 3785/6106 cut-off events. For 16021/16838 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 38907 event pairs, 507 based on Foata normal form. 737/6621 useless extension candidates. Maximal degree in co-relation 24162. Up to 2772 conditions per place. [2023-08-30 16:40:39,571 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 113 selfloop transitions, 14 changer transitions 16/161 dead transitions. [2023-08-30 16:40:39,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 161 transitions, 1874 flow [2023-08-30 16:40:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:40:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:40:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-30 16:40:39,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224089635854342 [2023-08-30 16:40:39,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-30 16:40:39,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-30 16:40:39,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:39,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-30 16:40:39,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 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:40:39,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:40:39,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:40:39,580 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 666 flow. Second operand 6 states and 746 transitions. [2023-08-30 16:40:39,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 161 transitions, 1874 flow [2023-08-30 16:40:39,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 161 transitions, 1848 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-30 16:40:39,601 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 746 flow [2023-08-30 16:40:39,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2023-08-30 16:40:39,602 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-08-30 16:40:39,602 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 746 flow [2023-08-30 16:40:39,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 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:40:39,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:39,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:39,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:40:39,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:39,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1481634007, now seen corresponding path program 1 times [2023-08-30 16:40:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333861092] [2023-08-30 16:40:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:39,869 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:40:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333861092] [2023-08-30 16:40:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333861092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:39,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:39,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:40:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983680698] [2023-08-30 16:40:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:39,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:40:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:40:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:40:39,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-08-30 16:40:39,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 746 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 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:40:39,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:39,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-08-30 16:40:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:40,601 INFO L130 PetriNetUnfolder]: 3173/5206 cut-off events. [2023-08-30 16:40:40,602 INFO L131 PetriNetUnfolder]: For 17560/18764 co-relation queries the response was YES. [2023-08-30 16:40:40,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24840 conditions, 5206 events. 3173/5206 cut-off events. For 17560/18764 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33406 event pairs, 285 based on Foata normal form. 540/5548 useless extension candidates. Maximal degree in co-relation 24803. Up to 2495 conditions per place. [2023-08-30 16:40:40,627 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 118 selfloop transitions, 23 changer transitions 27/184 dead transitions. [2023-08-30 16:40:40,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 184 transitions, 2126 flow [2023-08-30 16:40:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:40:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:40:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 993 transitions. [2023-08-30 16:40:40,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215336134453782 [2023-08-30 16:40:40,631 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 993 transitions. [2023-08-30 16:40:40,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 993 transitions. [2023-08-30 16:40:40,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:40,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 993 transitions. [2023-08-30 16:40:40,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 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:40:40,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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:40:40,638 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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:40:40,638 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 746 flow. Second operand 8 states and 993 transitions. [2023-08-30 16:40:40,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 184 transitions, 2126 flow [2023-08-30 16:40:40,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 184 transitions, 2012 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-30 16:40:40,859 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 794 flow [2023-08-30 16:40:40,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2023-08-30 16:40:40,860 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2023-08-30 16:40:40,860 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 794 flow [2023-08-30 16:40:40,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 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:40:40,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:40,860 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:40:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:40:40,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:40,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1850926202, now seen corresponding path program 1 times [2023-08-30 16:40:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:40,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686701018] [2023-08-30 16:40:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:41,121 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:40:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:41,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686701018] [2023-08-30 16:40:41,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686701018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:41,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:41,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:40:41,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038639057] [2023-08-30 16:40:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:41,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:40:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:40:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:40:41,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-08-30 16:40:41,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 794 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 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:40:41,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:41,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-08-30 16:40:41,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:41,802 INFO L130 PetriNetUnfolder]: 2944/4790 cut-off events. [2023-08-30 16:40:41,802 INFO L131 PetriNetUnfolder]: For 19144/19966 co-relation queries the response was YES. [2023-08-30 16:40:41,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22800 conditions, 4790 events. 2944/4790 cut-off events. For 19144/19966 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30293 event pairs, 266 based on Foata normal form. 237/4832 useless extension candidates. Maximal degree in co-relation 22762. Up to 1503 conditions per place. [2023-08-30 16:40:41,822 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 72 selfloop transitions, 26 changer transitions 78/182 dead transitions. [2023-08-30 16:40:41,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 182 transitions, 2066 flow [2023-08-30 16:40:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:40:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:40:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1216 transitions. [2023-08-30 16:40:41,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109243697478991 [2023-08-30 16:40:41,826 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1216 transitions. [2023-08-30 16:40:41,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1216 transitions. [2023-08-30 16:40:41,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:41,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1216 transitions. [2023-08-30 16:40:41,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.6) internal successors, (1216), 10 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:40:41,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 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:40:41,834 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 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:40:41,834 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 794 flow. Second operand 10 states and 1216 transitions. [2023-08-30 16:40:41,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 182 transitions, 2066 flow [2023-08-30 16:40:42,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 182 transitions, 1929 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-08-30 16:40:42,146 INFO L231 Difference]: Finished difference. Result has 87 places, 54 transitions, 441 flow [2023-08-30 16:40:42,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=441, PETRI_PLACES=87, PETRI_TRANSITIONS=54} [2023-08-30 16:40:42,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-08-30 16:40:42,147 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 54 transitions, 441 flow [2023-08-30 16:40:42,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 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:40:42,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:42,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:40:42,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:42,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1342447263, now seen corresponding path program 1 times [2023-08-30 16:40:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995637980] [2023-08-30 16:40:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:42,597 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:40:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995637980] [2023-08-30 16:40:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995637980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:40:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867688572] [2023-08-30 16:40:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:40:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:40:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:40:42,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 238 [2023-08-30 16:40:42,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 54 transitions, 441 flow. Second operand has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:40:42,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:42,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 238 [2023-08-30 16:40:42,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:43,090 INFO L130 PetriNetUnfolder]: 1441/2433 cut-off events. [2023-08-30 16:40:43,091 INFO L131 PetriNetUnfolder]: For 8509/8509 co-relation queries the response was YES. [2023-08-30 16:40:43,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11091 conditions, 2433 events. 1441/2433 cut-off events. For 8509/8509 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13171 event pairs, 90 based on Foata normal form. 1/2434 useless extension candidates. Maximal degree in co-relation 11065. Up to 1242 conditions per place. [2023-08-30 16:40:43,101 INFO L137 encePairwiseOnDemand]: 226/238 looper letters, 79 selfloop transitions, 23 changer transitions 65/167 dead transitions. [2023-08-30 16:40:43,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 167 transitions, 1652 flow [2023-08-30 16:40:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:40:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:40:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1193 transitions. [2023-08-30 16:40:43,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45569136745607336 [2023-08-30 16:40:43,105 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1193 transitions. [2023-08-30 16:40:43,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1193 transitions. [2023-08-30 16:40:43,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:43,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1193 transitions. [2023-08-30 16:40:43,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 108.45454545454545) internal successors, (1193), 11 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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:40:43,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 238.0) internal successors, (2856), 12 states have internal predecessors, (2856), 0 states have call successors, (0), 0 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:40:43,112 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 238.0) internal successors, (2856), 12 states have internal predecessors, (2856), 0 states have call successors, (0), 0 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:40:43,112 INFO L175 Difference]: Start difference. First operand has 87 places, 54 transitions, 441 flow. Second operand 11 states and 1193 transitions. [2023-08-30 16:40:43,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 167 transitions, 1652 flow [2023-08-30 16:40:43,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 167 transitions, 1275 flow, removed 74 selfloop flow, removed 17 redundant places. [2023-08-30 16:40:43,152 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 424 flow [2023-08-30 16:40:43,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=424, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2023-08-30 16:40:43,153 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2023-08-30 16:40:43,153 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 424 flow [2023-08-30 16:40:43,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:40:43,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:43,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:43,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:40:43,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:43,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash -636309467, now seen corresponding path program 2 times [2023-08-30 16:40:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777070927] [2023-08-30 16:40:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:43,412 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:40:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777070927] [2023-08-30 16:40:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777070927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:40:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114448503] [2023-08-30 16:40:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:43,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:40:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:40:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:40:43,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 16:40:43,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:40:43,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:43,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 16:40:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:43,657 INFO L130 PetriNetUnfolder]: 751/1356 cut-off events. [2023-08-30 16:40:43,657 INFO L131 PetriNetUnfolder]: For 3038/3087 co-relation queries the response was YES. [2023-08-30 16:40:43,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 1356 events. 751/1356 cut-off events. For 3038/3087 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7055 event pairs, 192 based on Foata normal form. 14/1333 useless extension candidates. Maximal degree in co-relation 5409. Up to 641 conditions per place. [2023-08-30 16:40:43,661 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 37 selfloop transitions, 1 changer transitions 57/98 dead transitions. [2023-08-30 16:40:43,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 812 flow [2023-08-30 16:40:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:40:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:40:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-30 16:40:43,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-08-30 16:40:43,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-30 16:40:43,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-30 16:40:43,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:43,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-30 16:40:43,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:40:43,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:43,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:40:43,666 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 424 flow. Second operand 5 states and 610 transitions. [2023-08-30 16:40:43,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 812 flow [2023-08-30 16:40:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 790 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-30 16:40:43,681 INFO L231 Difference]: Finished difference. Result has 75 places, 39 transitions, 230 flow [2023-08-30 16:40:43,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=75, PETRI_TRANSITIONS=39} [2023-08-30 16:40:43,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-08-30 16:40:43,682 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 39 transitions, 230 flow [2023-08-30 16:40:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:40:43,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:43,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:40:43,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:43,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1843686385, now seen corresponding path program 3 times [2023-08-30 16:40:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618062778] [2023-08-30 16:40:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:40:44,523 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:40:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:40:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618062778] [2023-08-30 16:40:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618062778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:40:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:40:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:40:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070384456] [2023-08-30 16:40:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:40:44,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:40:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:40:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:40:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:40:44,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 16:40:44,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 39 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:40:44,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:40:44,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 16:40:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:40:44,798 INFO L130 PetriNetUnfolder]: 169/362 cut-off events. [2023-08-30 16:40:44,798 INFO L131 PetriNetUnfolder]: For 919/967 co-relation queries the response was YES. [2023-08-30 16:40:44,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 362 events. 169/362 cut-off events. For 919/967 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1607 event pairs, 27 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1403. Up to 153 conditions per place. [2023-08-30 16:40:44,800 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 39 selfloop transitions, 5 changer transitions 24/72 dead transitions. [2023-08-30 16:40:44,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 567 flow [2023-08-30 16:40:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:40:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:40:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2023-08-30 16:40:44,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2023-08-30 16:40:44,802 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1029 transitions. [2023-08-30 16:40:44,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1029 transitions. [2023-08-30 16:40:44,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:40:44,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1029 transitions. [2023-08-30 16:40:44,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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:40:44,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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:40:44,808 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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:40:44,808 INFO L175 Difference]: Start difference. First operand has 75 places, 39 transitions, 230 flow. Second operand 9 states and 1029 transitions. [2023-08-30 16:40:44,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 567 flow [2023-08-30 16:40:44,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 507 flow, removed 10 selfloop flow, removed 15 redundant places. [2023-08-30 16:40:44,812 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 208 flow [2023-08-30 16:40:44,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2023-08-30 16:40:44,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-30 16:40:44,813 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 208 flow [2023-08-30 16:40:44,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:40:44,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:40:44,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:44,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:40:44,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:40:44,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:40:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash -385254341, now seen corresponding path program 4 times [2023-08-30 16:40:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:40:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594946501] [2023-08-30 16:40:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:40:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:40:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:40:44,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:40:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:40:44,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:40:44,907 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:40:44,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:40:44,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:40:44,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:40:44,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:40:44,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:40:44,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:40:44,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:40:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:40:44,911 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:40:44,916 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:40:44,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:40:44,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:40:44 BasicIcfg [2023-08-30 16:40:44,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:40:44,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:40:44,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:40:44,976 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:40:44,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:40:22" (3/4) ... [2023-08-30 16:40:44,978 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:40:45,042 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:40:45,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:40:45,042 INFO L158 Benchmark]: Toolchain (without parser) took 24232.70ms. Allocated memory was 67.1MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 32.6MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 613.4MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,043 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:40:45,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.51ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.3MB in the beginning and 62.4MB in the end (delta: -30.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.21ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,043 INFO L158 Benchmark]: Boogie Preprocessor took 61.83ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,044 INFO L158 Benchmark]: RCFGBuilder took 762.79ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 44.8MB in the end (delta: 12.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,044 INFO L158 Benchmark]: TraceAbstraction took 22688.34ms. Allocated memory was 88.1MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 44.4MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 589.1MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,044 INFO L158 Benchmark]: Witness Printer took 65.95ms. Allocated memory is still 3.6GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:40:45,046 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.51ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.3MB in the beginning and 62.4MB in the end (delta: -30.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.21ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.83ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.79ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 44.8MB in the end (delta: 12.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22688.34ms. Allocated memory was 88.1MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 44.4MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 589.1MB. Max. memory is 16.1GB. * Witness Printer took 65.95ms. Allocated memory is still 3.6GB. Free memory was 2.9GB in the beginning and 2.9GB 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: 3.8s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 7239 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3910, independent: 3702, independent conditional: 0, independent unconditional: 3702, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1524, independent: 1494, independent conditional: 0, independent unconditional: 1494, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3910, independent: 2208, independent conditional: 0, independent unconditional: 2208, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 1524, unknown conditional: 0, unknown unconditional: 1524] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t125; [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t125, ((void *)0), P0, ((void *)0))=-2, t125={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t126; [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t126, ((void *)0), P1, ((void *)0))=-1, t125={5:0}, t126={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t127; [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t127, ((void *)0), P2, ((void *)0))=0, t125={5:0}, t126={6:0}, t127={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t128; [L876] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t128, ((void *)0), P3, ((void *)0))=1, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1022 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 504 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2352 IncrementalHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 84 mSDtfsCounter, 2352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=10, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:40:45,073 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