./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:43:16,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:43:16,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:43:16,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:43:16,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:43:16,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:43:16,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:43:16,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:43:16,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:43:16,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:43:16,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:43:16,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:43:16,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:43:16,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:43:16,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:43:16,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:43:16,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:43:16,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:43:16,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:43:16,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:43:16,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:43:16,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:43:16,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:43:16,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:43:16,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:43:16,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:43:16,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:43:16,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:43:16,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:43:16,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:43:16,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:43:16,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:43:16,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:43:16,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:43:16,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:43:16,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:43:16,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:43:16,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:43:16,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:43:16,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:43:16,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:43:16,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:43:16,129 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:43:16,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:43:16,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:43:16,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:43:16,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:43:16,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:43:16,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:43:16,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:43:16,132 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:43:16,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:43:16,133 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:43:16,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:43:16,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:43:16,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:43:16,134 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:43:16,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:43:16,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:43:16,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:43:16,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:43:16,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:16,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:43:16,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:43:16,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:43:16,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:43:16,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:43:16,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:43:16,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:43:16,137 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:43:16,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:43:16,137 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:43:16,137 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:43:16,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:43:16,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:43:16,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:43:16,467 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:43:16,467 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:43:16,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-09-01 09:43:17,630 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:43:17,892 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:43:17,893 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-09-01 09:43:17,911 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ebb160d/63aed074c7b74feb9bfe5e1b6e1f13a5/FLAG88e5f21b4 [2023-09-01 09:43:17,931 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ebb160d/63aed074c7b74feb9bfe5e1b6e1f13a5 [2023-09-01 09:43:17,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:43:17,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:43:17,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:17,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:43:17,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:43:17,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:17" (1/1) ... [2023-09-01 09:43:17,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258b0a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:17, skipping insertion in model container [2023-09-01 09:43:17,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:17" (1/1) ... [2023-09-01 09:43:17,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:43:17,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:43:18,178 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/mix013.oepc.i[945,958] [2023-09-01 09:43:18,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:18,400 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:43:18,408 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/mix013.oepc.i[945,958] [2023-09-01 09:43:18,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:18,498 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:18,498 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:18,504 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:43:18,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18 WrapperNode [2023-09-01 09:43:18,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:18,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:18,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:43:18,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:43:18,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,549 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-09-01 09:43:18,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:18,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:43:18,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:43:18,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:43:18,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:43:18,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:43:18,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:43:18,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:43:18,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (1/1) ... [2023-09-01 09:43:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:43:18,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:43:18,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:43:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:43:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:43:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:43:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:43:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:43:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:43:18,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:43:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:43:18,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:43:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:43:18,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:43:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:43:18,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:43:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:43:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:43:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:43:18,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:43:18,658 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:43:18,853 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:43:18,855 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:43:19,238 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:43:19,379 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:43:19,379 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:43:19,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:19 BoogieIcfgContainer [2023-09-01 09:43:19,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:43:19,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:43:19,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:43:19,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:43:19,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:43:17" (1/3) ... [2023-09-01 09:43:19,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac802b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:19, skipping insertion in model container [2023-09-01 09:43:19,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:18" (2/3) ... [2023-09-01 09:43:19,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac802b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:19, skipping insertion in model container [2023-09-01 09:43:19,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:19" (3/3) ... [2023-09-01 09:43:19,392 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2023-09-01 09:43:19,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:43:19,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:43:19,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:43:19,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:43:19,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:43:19,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2023-09-01 09:43:19,584 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-09-01 09:43:19,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:19,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:43:19,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2023-09-01 09:43:19,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-09-01 09:43:19,601 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:43:19,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-09-01 09:43:19,615 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-09-01 09:43:19,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-09-01 09:43:19,665 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-09-01 09:43:19,666 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:19,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:43:19,671 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-09-01 09:43:23,711 INFO L134 LiptonReduction]: Checked pairs total: 10234 [2023-09-01 09:43:23,712 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:43:23,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:43:23,728 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;@245c090f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:43:23,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:43:23,731 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:43:23,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:23,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:23,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:43:23,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:23,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 554559, now seen corresponding path program 1 times [2023-09-01 09:43:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854014234] [2023-09-01 09:43:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854014234] [2023-09-01 09:43:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854014234] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102386543] [2023-09-01 09:43:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:24,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:24,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:24,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:24,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 241 [2023-09-01 09:43:24,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:24,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:24,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 241 [2023-09-01 09:43:24,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:25,506 INFO L130 PetriNetUnfolder]: 6855/9371 cut-off events. [2023-09-01 09:43:25,506 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-09-01 09:43:25,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18811 conditions, 9371 events. 6855/9371 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 48378 event pairs, 3527 based on Foata normal form. 320/9026 useless extension candidates. Maximal degree in co-relation 18799. Up to 7399 conditions per place. [2023-09-01 09:43:25,557 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 43 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-09-01 09:43:25,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 227 flow [2023-09-01 09:43:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-09-01 09:43:25,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5615491009681881 [2023-09-01 09:43:25,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-09-01 09:43:25,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-09-01 09:43:25,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:25,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-09-01 09:43:25,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:25,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:25,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:25,583 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 406 transitions. [2023-09-01 09:43:25,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 227 flow [2023-09-01 09:43:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:25,588 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-09-01 09:43:25,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-09-01 09:43:25,593 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-09-01 09:43:25,593 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-09-01 09:43:25,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:25,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:25,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:25,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:43:25,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:25,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -641385965, now seen corresponding path program 1 times [2023-09-01 09:43:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886174724] [2023-09-01 09:43:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886174724] [2023-09-01 09:43:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886174724] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055676284] [2023-09-01 09:43:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:25,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:25,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:25,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:25,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:25,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-09-01 09:43:25,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:25,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:25,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-09-01 09:43:25,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:28,121 INFO L130 PetriNetUnfolder]: 16565/22304 cut-off events. [2023-09-01 09:43:28,122 INFO L131 PetriNetUnfolder]: For 1137/1137 co-relation queries the response was YES. [2023-09-01 09:43:28,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46122 conditions, 22304 events. 16565/22304 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 110236 event pairs, 8983 based on Foata normal form. 900/23204 useless extension candidates. Maximal degree in co-relation 46112. Up to 19157 conditions per place. [2023-09-01 09:43:28,277 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 41 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2023-09-01 09:43:28,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 316 flow [2023-09-01 09:43:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-09-01 09:43:28,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062240663900415 [2023-09-01 09:43:28,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-09-01 09:43:28,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-09-01 09:43:28,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:28,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-09-01 09:43:28,286 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-09-01 09:43:28,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:28,291 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:28,291 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 610 transitions. [2023-09-01 09:43:28,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 316 flow [2023-09-01 09:43:28,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:28,295 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 113 flow [2023-09-01 09:43:28,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-09-01 09:43:28,296 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-09-01 09:43:28,296 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 113 flow [2023-09-01 09:43:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:28,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:28,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:28,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:43:28,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:28,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 657428209, now seen corresponding path program 1 times [2023-09-01 09:43:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355525699] [2023-09-01 09:43:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355525699] [2023-09-01 09:43:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355525699] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:28,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154333411] [2023-09-01 09:43:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:43:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:43:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:43:28,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-09-01 09:43:28,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:28,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:28,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-09-01 09:43:28,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:30,575 INFO L130 PetriNetUnfolder]: 14765/19888 cut-off events. [2023-09-01 09:43:30,575 INFO L131 PetriNetUnfolder]: For 9859/9859 co-relation queries the response was YES. [2023-09-01 09:43:30,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49107 conditions, 19888 events. 14765/19888 cut-off events. For 9859/9859 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 95535 event pairs, 3813 based on Foata normal form. 852/20740 useless extension candidates. Maximal degree in co-relation 49094. Up to 12401 conditions per place. [2023-09-01 09:43:30,676 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 46 selfloop transitions, 3 changer transitions 32/81 dead transitions. [2023-09-01 09:43:30,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 411 flow [2023-09-01 09:43:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-09-01 09:43:30,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095435684647303 [2023-09-01 09:43:30,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-09-01 09:43:30,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-09-01 09:43:30,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:30,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-09-01 09:43:30,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:30,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:30,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:30,685 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 113 flow. Second operand 5 states and 614 transitions. [2023-09-01 09:43:30,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 411 flow [2023-09-01 09:43:30,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:30,854 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 121 flow [2023-09-01 09:43:30,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-09-01 09:43:30,856 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-09-01 09:43:30,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 121 flow [2023-09-01 09:43:30,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:30,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:30,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:30,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:43:30,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:30,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2034950308, now seen corresponding path program 1 times [2023-09-01 09:43:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588952807] [2023-09-01 09:43:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588952807] [2023-09-01 09:43:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588952807] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:31,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072685842] [2023-09-01 09:43:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:31,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 241 [2023-09-01 09:43:31,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:31,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 241 [2023-09-01 09:43:31,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:32,338 INFO L130 PetriNetUnfolder]: 8172/11842 cut-off events. [2023-09-01 09:43:32,339 INFO L131 PetriNetUnfolder]: For 6726/6951 co-relation queries the response was YES. [2023-09-01 09:43:32,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27629 conditions, 11842 events. 8172/11842 cut-off events. For 6726/6951 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 67601 event pairs, 2986 based on Foata normal form. 500/12112 useless extension candidates. Maximal degree in co-relation 27613. Up to 6867 conditions per place. [2023-09-01 09:43:32,410 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 40 selfloop transitions, 3 changer transitions 23/73 dead transitions. [2023-09-01 09:43:32,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 343 flow [2023-09-01 09:43:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-09-01 09:43:32,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369294605809128 [2023-09-01 09:43:32,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-09-01 09:43:32,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-09-01 09:43:32,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:32,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-09-01 09:43:32,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,423 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,423 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 121 flow. Second operand 5 states and 647 transitions. [2023-09-01 09:43:32,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 343 flow [2023-09-01 09:43:32,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 333 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:32,527 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 126 flow [2023-09-01 09:43:32,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-09-01 09:43:32,529 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-09-01 09:43:32,529 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 126 flow [2023-09-01 09:43:32,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:32,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:32,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:43:32,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:32,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1019303317, now seen corresponding path program 1 times [2023-09-01 09:43:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:32,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141621834] [2023-09-01 09:43:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:32,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141621834] [2023-09-01 09:43:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141621834] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:32,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:32,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697809210] [2023-09-01 09:43:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:32,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:32,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:32,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-09-01 09:43:32,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:32,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-09-01 09:43:32,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:33,488 INFO L130 PetriNetUnfolder]: 5237/7739 cut-off events. [2023-09-01 09:43:33,489 INFO L131 PetriNetUnfolder]: For 2041/2161 co-relation queries the response was YES. [2023-09-01 09:43:33,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17414 conditions, 7739 events. 5237/7739 cut-off events. For 2041/2161 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44779 event pairs, 1078 based on Foata normal form. 541/8090 useless extension candidates. Maximal degree in co-relation 17397. Up to 5000 conditions per place. [2023-09-01 09:43:33,530 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 61 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-09-01 09:43:33,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 366 flow [2023-09-01 09:43:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-09-01 09:43:33,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294605809128631 [2023-09-01 09:43:33,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-09-01 09:43:33,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-09-01 09:43:33,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:33,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-09-01 09:43:33,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,539 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 126 flow. Second operand 5 states and 638 transitions. [2023-09-01 09:43:33,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 366 flow [2023-09-01 09:43:33,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 356 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:33,557 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 191 flow [2023-09-01 09:43:33,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-09-01 09:43:33,559 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-09-01 09:43:33,560 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 191 flow [2023-09-01 09:43:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:33,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:33,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:43:33,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:33,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 684158938, now seen corresponding path program 1 times [2023-09-01 09:43:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573359353] [2023-09-01 09:43:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573359353] [2023-09-01 09:43:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573359353] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:33,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:43:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627685449] [2023-09-01 09:43:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:33,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:43:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:43:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:43:33,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-09-01 09:43:33,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:33,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-09-01 09:43:33,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:34,543 INFO L130 PetriNetUnfolder]: 3948/6076 cut-off events. [2023-09-01 09:43:34,544 INFO L131 PetriNetUnfolder]: For 2865/2935 co-relation queries the response was YES. [2023-09-01 09:43:34,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17057 conditions, 6076 events. 3948/6076 cut-off events. For 2865/2935 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 36189 event pairs, 598 based on Foata normal form. 350/6282 useless extension candidates. Maximal degree in co-relation 17039. Up to 1865 conditions per place. [2023-09-01 09:43:34,573 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 83 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2023-09-01 09:43:34,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 591 flow [2023-09-01 09:43:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 895 transitions. [2023-09-01 09:43:34,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305275637225845 [2023-09-01 09:43:34,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 895 transitions. [2023-09-01 09:43:34,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 895 transitions. [2023-09-01 09:43:34,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:34,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 895 transitions. [2023-09-01 09:43:34,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,584 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 191 flow. Second operand 7 states and 895 transitions. [2023-09-01 09:43:34,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 591 flow [2023-09-01 09:43:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:34,606 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 320 flow [2023-09-01 09:43:34,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-09-01 09:43:34,606 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-09-01 09:43:34,607 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 320 flow [2023-09-01 09:43:34,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:34,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:34,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:43:34,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:34,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1595725164, now seen corresponding path program 1 times [2023-09-01 09:43:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90829962] [2023-09-01 09:43:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90829962] [2023-09-01 09:43:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90829962] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208293933] [2023-09-01 09:43:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:34,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:34,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-09-01 09:43:34,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:34,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-09-01 09:43:34,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:35,704 INFO L130 PetriNetUnfolder]: 3526/5450 cut-off events. [2023-09-01 09:43:35,704 INFO L131 PetriNetUnfolder]: For 6328/6390 co-relation queries the response was YES. [2023-09-01 09:43:35,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 5450 events. 3526/5450 cut-off events. For 6328/6390 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32513 event pairs, 504 based on Foata normal form. 116/5433 useless extension candidates. Maximal degree in co-relation 17832. Up to 1743 conditions per place. [2023-09-01 09:43:35,734 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 92 selfloop transitions, 28 changer transitions 11/140 dead transitions. [2023-09-01 09:43:35,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 140 transitions, 870 flow [2023-09-01 09:43:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:43:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:43:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1150 transitions. [2023-09-01 09:43:35,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301982480405717 [2023-09-01 09:43:35,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1150 transitions. [2023-09-01 09:43:35,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1150 transitions. [2023-09-01 09:43:35,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:35,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1150 transitions. [2023-09-01 09:43:35,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,748 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,748 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 320 flow. Second operand 9 states and 1150 transitions. [2023-09-01 09:43:35,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 140 transitions, 870 flow [2023-09-01 09:43:35,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 140 transitions, 820 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:43:35,976 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 448 flow [2023-09-01 09:43:35,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-09-01 09:43:35,977 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-09-01 09:43:35,977 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 448 flow [2023-09-01 09:43:35,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:35,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:35,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:43:35,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:35,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1548607585, now seen corresponding path program 1 times [2023-09-01 09:43:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532298251] [2023-09-01 09:43:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532298251] [2023-09-01 09:43:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532298251] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:43:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701992966] [2023-09-01 09:43:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:36,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:43:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:43:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:43:36,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-09-01 09:43:36,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 448 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:36,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-09-01 09:43:36,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:37,836 INFO L130 PetriNetUnfolder]: 5947/9556 cut-off events. [2023-09-01 09:43:37,836 INFO L131 PetriNetUnfolder]: For 21066/21112 co-relation queries the response was YES. [2023-09-01 09:43:37,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33692 conditions, 9556 events. 5947/9556 cut-off events. For 21066/21112 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 65432 event pairs, 1558 based on Foata normal form. 10/9393 useless extension candidates. Maximal degree in co-relation 33667. Up to 4519 conditions per place. [2023-09-01 09:43:37,896 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 177 selfloop transitions, 13 changer transitions 24/223 dead transitions. [2023-09-01 09:43:37,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 223 transitions, 2192 flow [2023-09-01 09:43:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:43:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:43:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 994 transitions. [2023-09-01 09:43:37,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155601659751037 [2023-09-01 09:43:37,904 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 994 transitions. [2023-09-01 09:43:37,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 994 transitions. [2023-09-01 09:43:37,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:37,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 994 transitions. [2023-09-01 09:43:37,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.25) internal successors, (994), 8 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,910 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,911 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 448 flow. Second operand 8 states and 994 transitions. [2023-09-01 09:43:37,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 223 transitions, 2192 flow [2023-09-01 09:43:38,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 223 transitions, 1755 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:38,586 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 465 flow [2023-09-01 09:43:38,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=465, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-09-01 09:43:38,587 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-09-01 09:43:38,587 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 465 flow [2023-09-01 09:43:38,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:38,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:38,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:43:38,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:38,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1769291287, now seen corresponding path program 2 times [2023-09-01 09:43:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:38,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998447642] [2023-09-01 09:43:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998447642] [2023-09-01 09:43:38,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998447642] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:38,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:38,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400189692] [2023-09-01 09:43:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:38,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:38,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:38,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:38,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-09-01 09:43:38,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:38,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-09-01 09:43:38,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:40,842 INFO L130 PetriNetUnfolder]: 17859/26077 cut-off events. [2023-09-01 09:43:40,842 INFO L131 PetriNetUnfolder]: For 47309/47309 co-relation queries the response was YES. [2023-09-01 09:43:40,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95519 conditions, 26077 events. 17859/26077 cut-off events. For 47309/47309 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 167442 event pairs, 1914 based on Foata normal form. 16/26093 useless extension candidates. Maximal degree in co-relation 95488. Up to 13749 conditions per place. [2023-09-01 09:43:41,000 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 99 selfloop transitions, 10 changer transitions 112/221 dead transitions. [2023-09-01 09:43:41,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 221 transitions, 1770 flow [2023-09-01 09:43:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 846 transitions. [2023-09-01 09:43:41,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014819205690575 [2023-09-01 09:43:41,003 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 846 transitions. [2023-09-01 09:43:41,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 846 transitions. [2023-09-01 09:43:41,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:41,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 846 transitions. [2023-09-01 09:43:41,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,009 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,009 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 465 flow. Second operand 7 states and 846 transitions. [2023-09-01 09:43:41,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 221 transitions, 1770 flow [2023-09-01 09:43:42,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 221 transitions, 1765 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:42,817 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 379 flow [2023-09-01 09:43:42,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-09-01 09:43:42,818 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2023-09-01 09:43:42,818 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 379 flow [2023-09-01 09:43:42,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:42,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:42,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:43:42,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:42,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2049393869, now seen corresponding path program 3 times [2023-09-01 09:43:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044398400] [2023-09-01 09:43:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044398400] [2023-09-01 09:43:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044398400] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:43:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624605412] [2023-09-01 09:43:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:43:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:43:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:43:43,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-09-01 09:43:43,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:43,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:43,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-09-01 09:43:43,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:43,929 INFO L130 PetriNetUnfolder]: 3271/5268 cut-off events. [2023-09-01 09:43:43,930 INFO L131 PetriNetUnfolder]: For 8336/8527 co-relation queries the response was YES. [2023-09-01 09:43:43,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17817 conditions, 5268 events. 3271/5268 cut-off events. For 8336/8527 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33903 event pairs, 662 based on Foata normal form. 70/5165 useless extension candidates. Maximal degree in co-relation 17789. Up to 2061 conditions per place. [2023-09-01 09:43:43,966 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 82 selfloop transitions, 18 changer transitions 20/128 dead transitions. [2023-09-01 09:43:43,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 908 flow [2023-09-01 09:43:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:43:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:43:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 996 transitions. [2023-09-01 09:43:43,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516597510373444 [2023-09-01 09:43:43,970 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 996 transitions. [2023-09-01 09:43:43,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 996 transitions. [2023-09-01 09:43:43,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:43,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 996 transitions. [2023-09-01 09:43:43,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.5) internal successors, (996), 8 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:43,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:43,976 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:43,976 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 379 flow. Second operand 8 states and 996 transitions. [2023-09-01 09:43:43,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 908 flow [2023-09-01 09:43:44,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 828 flow, removed 33 selfloop flow, removed 11 redundant places. [2023-09-01 09:43:44,110 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 330 flow [2023-09-01 09:43:44,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-09-01 09:43:44,111 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-09-01 09:43:44,111 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 330 flow [2023-09-01 09:43:44,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:44,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:44,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:44,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:43:44,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:44,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 271414072, now seen corresponding path program 1 times [2023-09-01 09:43:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650312067] [2023-09-01 09:43:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650312067] [2023-09-01 09:43:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650312067] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:44,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648200680] [2023-09-01 09:43:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:44,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-09-01 09:43:44,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:44,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:44,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-09-01 09:43:44,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:45,262 INFO L130 PetriNetUnfolder]: 4917/7523 cut-off events. [2023-09-01 09:43:45,262 INFO L131 PetriNetUnfolder]: For 15338/15338 co-relation queries the response was YES. [2023-09-01 09:43:45,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28003 conditions, 7523 events. 4917/7523 cut-off events. For 15338/15338 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 41939 event pairs, 1030 based on Foata normal form. 1/7524 useless extension candidates. Maximal degree in co-relation 27977. Up to 3488 conditions per place. [2023-09-01 09:43:45,304 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 75 selfloop transitions, 4 changer transitions 48/127 dead transitions. [2023-09-01 09:43:45,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 1042 flow [2023-09-01 09:43:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-09-01 09:43:45,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825133372851215 [2023-09-01 09:43:45,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-09-01 09:43:45,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-09-01 09:43:45,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:45,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-09-01 09:43:45,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:45,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:45,314 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:45,314 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 330 flow. Second operand 7 states and 814 transitions. [2023-09-01 09:43:45,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 1042 flow [2023-09-01 09:43:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 859 flow, removed 53 selfloop flow, removed 9 redundant places. [2023-09-01 09:43:45,462 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 255 flow [2023-09-01 09:43:45,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-09-01 09:43:45,463 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-09-01 09:43:45,463 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 255 flow [2023-09-01 09:43:45,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:45,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:45,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:45,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:43:45,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:45,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 743488830, now seen corresponding path program 2 times [2023-09-01 09:43:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:45,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033253888] [2023-09-01 09:43:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033253888] [2023-09-01 09:43:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033253888] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367049507] [2023-09-01 09:43:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:45,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:45,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:45,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-09-01 09:43:45,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:45,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:45,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-09-01 09:43:45,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:46,361 INFO L130 PetriNetUnfolder]: 3394/5217 cut-off events. [2023-09-01 09:43:46,361 INFO L131 PetriNetUnfolder]: For 6793/6793 co-relation queries the response was YES. [2023-09-01 09:43:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 5217 events. 3394/5217 cut-off events. For 6793/6793 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 27676 event pairs, 677 based on Foata normal form. 1/5218 useless extension candidates. Maximal degree in co-relation 17224. Up to 2758 conditions per place. [2023-09-01 09:43:46,377 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 57 selfloop transitions, 3 changer transitions 60/120 dead transitions. [2023-09-01 09:43:46,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 824 flow [2023-09-01 09:43:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2023-09-01 09:43:46,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48132780082987553 [2023-09-01 09:43:46,380 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2023-09-01 09:43:46,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2023-09-01 09:43:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:46,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2023-09-01 09:43:46,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:46,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:46,385 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:46,386 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 255 flow. Second operand 7 states and 812 transitions. [2023-09-01 09:43:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 824 flow [2023-09-01 09:43:46,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 804 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:46,443 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 228 flow [2023-09-01 09:43:46,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-09-01 09:43:46,443 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2023-09-01 09:43:46,444 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 228 flow [2023-09-01 09:43:46,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:46,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:46,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:46,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:43:46,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:46,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 646544992, now seen corresponding path program 3 times [2023-09-01 09:43:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201375062] [2023-09-01 09:43:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201375062] [2023-09-01 09:43:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201375062] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:43:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067675289] [2023-09-01 09:43:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:47,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:43:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:43:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:43:47,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-09-01 09:43:47,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:47,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:47,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-09-01 09:43:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:47,811 INFO L130 PetriNetUnfolder]: 962/1579 cut-off events. [2023-09-01 09:43:47,811 INFO L131 PetriNetUnfolder]: For 2208/2246 co-relation queries the response was YES. [2023-09-01 09:43:47,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1579 events. 962/1579 cut-off events. For 2208/2246 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7619 event pairs, 151 based on Foata normal form. 32/1568 useless extension candidates. Maximal degree in co-relation 5269. Up to 1000 conditions per place. [2023-09-01 09:43:47,816 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 53 selfloop transitions, 4 changer transitions 34/96 dead transitions. [2023-09-01 09:43:47,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 646 flow [2023-09-01 09:43:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:43:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:43:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 954 transitions. [2023-09-01 09:43:47,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948132780082988 [2023-09-01 09:43:47,819 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 954 transitions. [2023-09-01 09:43:47,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 954 transitions. [2023-09-01 09:43:47,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:47,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 954 transitions. [2023-09-01 09:43:47,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.25) internal successors, (954), 8 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:47,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:47,824 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:47,825 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 228 flow. Second operand 8 states and 954 transitions. [2023-09-01 09:43:47,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 646 flow [2023-09-01 09:43:47,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 627 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-09-01 09:43:47,838 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 222 flow [2023-09-01 09:43:47,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-09-01 09:43:47,839 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-09-01 09:43:47,840 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 222 flow [2023-09-01 09:43:47,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:47,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:47,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:47,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:43:47,841 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:47,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -996024222, now seen corresponding path program 4 times [2023-09-01 09:43:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951909536] [2023-09-01 09:43:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:47,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:43:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:48,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:43:48,017 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:43:48,018 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:43:48,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:43:48,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:43:48,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:43:48,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:43:48,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:43:48,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:43:48,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:43:48,020 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:48,026 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:43:48,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:43:48,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:43:48 BasicIcfg [2023-09-01 09:43:48,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:43:48,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:43:48,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:43:48,113 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:43:48,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:19" (3/4) ... [2023-09-01 09:43:48,115 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:43:48,209 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:43:48,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:43:48,210 INFO L158 Benchmark]: Toolchain (without parser) took 30274.96ms. Allocated memory was 69.2MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 34.2MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 308.3MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,211 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 69.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:43:48,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.02ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 34.0MB in the beginning and 76.9MB in the end (delta: -42.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 74.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,212 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 72.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,213 INFO L158 Benchmark]: RCFGBuilder took 804.35ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 61.1MB in the end (delta: 11.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,214 INFO L158 Benchmark]: TraceAbstraction took 28725.87ms. Allocated memory was 100.7MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 60.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 286.3MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,214 INFO L158 Benchmark]: Witness Printer took 96.69ms. Allocated memory is still 4.3GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:43:48,216 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.10ms. Allocated memory is still 69.2MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.02ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 34.0MB in the beginning and 76.9MB in the end (delta: -42.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 74.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 72.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 804.35ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 61.1MB in the end (delta: 11.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28725.87ms. Allocated memory was 100.7MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 60.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 286.3MB. Max. memory is 16.1GB. * Witness Printer took 96.69ms. Allocated memory is still 4.3GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 46 PlacesAfterwards, 130 TransitionsBefore, 34 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 10234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4236, independent: 3967, independent conditional: 0, independent unconditional: 3967, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1707, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4236, independent: 2307, independent conditional: 0, independent unconditional: 2307, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 1707, unknown conditional: 0, unknown unconditional: 1707] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 0, Positive unconditional cache size: 192, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=-3, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=-2, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=-1, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 880]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 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: 28.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1070 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2570 IncrementalHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 157 mSDtfsCounter, 2570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=8, InterpolantAutomatonStates: 84, 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.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:43:48,247 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