./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:14:50,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:14:50,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:14:50,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:14:50,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:14:50,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:14:50,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:14:50,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:14:50,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:14:50,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:14:50,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:14:50,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:14:50,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:14:50,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:14:50,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:14:50,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:14:50,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:14:50,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:14:50,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:14:50,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:14:50,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:14:50,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:14:50,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:14:50,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:14:50,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:14:50,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:14:50,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:14:50,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:14:50,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:14:50,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:14:50,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:14:50,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:14:50,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:14:50,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:14:50,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:14:50,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:14:50,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:14:50,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:14:50,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:14:50,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:14:50,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:14:50,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:14:50,437 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:14:50,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:14:50,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:14:50,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:14:50,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:14:50,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:14:50,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:14:50,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:14:50,441 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:14:50,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:14:50,442 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:14:50,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:14:50,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:14:50,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:14:50,443 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:14:50,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:14:50,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:14:50,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:14:50,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:14:50,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:50,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:14:50,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:14:50,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:14:50,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:14:50,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:14:50,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:14:50,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:14:50,446 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:14:50,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:14:50,447 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:14:50,447 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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:14:50,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:14:50,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:14:50,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:14:50,737 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:14:50,737 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:14:50,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:14:51,810 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:14:52,059 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:14:52,059 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:14:52,072 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ec2953f/b51d3f0e4742440d8c47249e3c5201d6/FLAG91f0a0a5d [2023-08-30 23:14:52,086 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ec2953f/b51d3f0e4742440d8c47249e3c5201d6 [2023-08-30 23:14:52,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:14:52,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:14:52,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:52,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:14:52,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:14:52,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620d85ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52, skipping insertion in model container [2023-08-30 23:14:52,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:14:52,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:14:52,267 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:14:52,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:52,474 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:14:52,485 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:14:52,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:52,571 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:52,571 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:52,577 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:14:52,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52 WrapperNode [2023-08-30 23:14:52,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:52,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:52,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:14:52,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:14:52,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,643 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 23:14:52,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:52,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:14:52,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:14:52,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:14:52,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,666 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:14:52,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:14:52,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:14:52,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:14:52,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (1/1) ... [2023-08-30 23:14:52,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:14:52,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:14:52,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:14:52,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:14:52,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:14:52,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:14:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:14:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:14:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:14:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:14:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:14:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:14:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:14:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:14:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:14:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:14:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:14:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:14:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:14:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:14:52,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:14:52,915 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:14:52,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:14:53,279 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:14:53,393 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:14:53,394 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:14:53,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:53 BoogieIcfgContainer [2023-08-30 23:14:53,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:14:53,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:14:53,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:14:53,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:14:53,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:14:52" (1/3) ... [2023-08-30 23:14:53,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe1844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:53, skipping insertion in model container [2023-08-30 23:14:53,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:52" (2/3) ... [2023-08-30 23:14:53,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe1844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:53, skipping insertion in model container [2023-08-30 23:14:53,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:53" (3/3) ... [2023-08-30 23:14:53,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:14:53,408 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:14:53,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:14:53,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:14:53,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:14:53,466 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:14:53,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:14:53,556 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:14:53,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:53,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:14:53,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:14:53,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 23:14:53,567 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:14:53,574 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:14:53,576 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:14:53,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 23:14:53,606 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:14:53,606 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:53,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:14:53,612 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-30 23:14:57,109 INFO L134 LiptonReduction]: Checked pairs total: 8526 [2023-08-30 23:14:57,109 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-30 23:14:57,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:14:57,126 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;@c8333ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:14:57,126 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:14:57,129 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 23:14:57,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:57,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:57,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:14:57,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:57,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash 548595, now seen corresponding path program 1 times [2023-08-30 23:14:57,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908526115] [2023-08-30 23:14:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908526115] [2023-08-30 23:14:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908526115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:14:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835920496] [2023-08-30 23:14:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:57,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:14:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:57,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:14:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:14:57,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 238 [2023-08-30 23:14:57,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:57,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:57,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 238 [2023-08-30 23:14:57,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:58,602 INFO L130 PetriNetUnfolder]: 5879/8507 cut-off events. [2023-08-30 23:14:58,603 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 23:14:58,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 8507 events. 5879/8507 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 50976 event pairs, 1079 based on Foata normal form. 0/8167 useless extension candidates. Maximal degree in co-relation 16639. Up to 6367 conditions per place. [2023-08-30 23:14:58,651 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-30 23:14:58,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 217 flow [2023-08-30 23:14:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:14:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:14:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-30 23:14:58,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5532212885154062 [2023-08-30 23:14:58,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-30 23:14:58,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-30 23:14:58,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:58,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-30 23:14:58,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,684 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 395 transitions. [2023-08-30 23:14:58,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 217 flow [2023-08-30 23:14:58,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:58,691 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-30 23:14:58,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 23:14:58,695 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 23:14:58,696 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-30 23:14:58,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:58,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:14:58,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:58,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2063599705, now seen corresponding path program 1 times [2023-08-30 23:14:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6077058] [2023-08-30 23:14:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6077058] [2023-08-30 23:14:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6077058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:59,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375666774] [2023-08-30 23:14:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:59,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:59,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:14:59,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:59,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:59,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:14:59,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:01,931 INFO L130 PetriNetUnfolder]: 24574/33203 cut-off events. [2023-08-30 23:15:01,932 INFO L131 PetriNetUnfolder]: For 1637/1637 co-relation queries the response was YES. [2023-08-30 23:15:01,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68444 conditions, 33203 events. 24574/33203 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 181252 event pairs, 8056 based on Foata normal form. 1374/34577 useless extension candidates. Maximal degree in co-relation 68434. Up to 14653 conditions per place. [2023-08-30 23:15:02,227 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 44 selfloop transitions, 9 changer transitions 35/88 dead transitions. [2023-08-30 23:15:02,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2023-08-30 23:15:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:15:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:15:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-30 23:15:02,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084033613445378 [2023-08-30 23:15:02,230 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-30 23:15:02,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-30 23:15:02,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:02,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-30 23:15:02,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,236 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,236 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 605 transitions. [2023-08-30 23:15:02,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2023-08-30 23:15:02,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:02,239 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 156 flow [2023-08-30 23:15:02,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-30 23:15:02,240 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-30 23:15:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 156 flow [2023-08-30 23:15:02,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:02,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:15:02,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:02,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -452939485, now seen corresponding path program 1 times [2023-08-30 23:15:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055304475] [2023-08-30 23:15:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055304475] [2023-08-30 23:15:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055304475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:02,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286107506] [2023-08-30 23:15:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:02,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:15:02,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:02,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:15:02,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:04,753 INFO L130 PetriNetUnfolder]: 23204/31608 cut-off events. [2023-08-30 23:15:04,753 INFO L131 PetriNetUnfolder]: For 27737/27737 co-relation queries the response was YES. [2023-08-30 23:15:04,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90178 conditions, 31608 events. 23204/31608 cut-off events. For 27737/27737 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 175306 event pairs, 1716 based on Foata normal form. 1329/32937 useless extension candidates. Maximal degree in co-relation 90164. Up to 13774 conditions per place. [2023-08-30 23:15:04,895 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 59 selfloop transitions, 13 changer transitions 52/124 dead transitions. [2023-08-30 23:15:04,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 748 flow [2023-08-30 23:15:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-30 23:15:04,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018007202881153 [2023-08-30 23:15:04,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-30 23:15:04,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-30 23:15:04,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:04,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-30 23:15:04,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:04,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:04,906 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:04,906 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 156 flow. Second operand 7 states and 836 transitions. [2023-08-30 23:15:04,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 748 flow [2023-08-30 23:15:04,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 124 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:04,958 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 258 flow [2023-08-30 23:15:04,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-30 23:15:04,959 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-08-30 23:15:04,962 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 258 flow [2023-08-30 23:15:04,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:04,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:04,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:04,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:15:04,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:04,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:04,965 INFO L85 PathProgramCache]: Analyzing trace with hash -452902967, now seen corresponding path program 1 times [2023-08-30 23:15:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:04,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889602573] [2023-08-30 23:15:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889602573] [2023-08-30 23:15:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889602573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415589485] [2023-08-30 23:15:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:05,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:05,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:15:05,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:05,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:05,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:15:05,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:07,609 INFO L130 PetriNetUnfolder]: 22064/30057 cut-off events. [2023-08-30 23:15:07,609 INFO L131 PetriNetUnfolder]: For 68647/68647 co-relation queries the response was YES. [2023-08-30 23:15:07,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96745 conditions, 30057 events. 22064/30057 cut-off events. For 68647/68647 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 165536 event pairs, 4160 based on Foata normal form. 1138/31195 useless extension candidates. Maximal degree in co-relation 96725. Up to 13203 conditions per place. [2023-08-30 23:15:07,745 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 70 selfloop transitions, 21 changer transitions 48/139 dead transitions. [2023-08-30 23:15:07,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 139 transitions, 966 flow [2023-08-30 23:15:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-30 23:15:07,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048019207683073 [2023-08-30 23:15:07,749 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-30 23:15:07,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-30 23:15:07,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:07,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-30 23:15:07,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,755 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,755 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 258 flow. Second operand 7 states and 841 transitions. [2023-08-30 23:15:07,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 139 transitions, 966 flow [2023-08-30 23:15:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 139 transitions, 958 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 23:15:07,865 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 474 flow [2023-08-30 23:15:07,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2023-08-30 23:15:07,866 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-08-30 23:15:07,866 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 474 flow [2023-08-30 23:15:07,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:07,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:07,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:15:07,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:07,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1156206529, now seen corresponding path program 1 times [2023-08-30 23:15:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:07,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557823898] [2023-08-30 23:15:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:08,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557823898] [2023-08-30 23:15:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557823898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:08,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829877210] [2023-08-30 23:15:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:08,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:08,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:15:08,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:08,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:08,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:15:08,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:10,184 INFO L130 PetriNetUnfolder]: 21217/28927 cut-off events. [2023-08-30 23:15:10,185 INFO L131 PetriNetUnfolder]: For 116234/116234 co-relation queries the response was YES. [2023-08-30 23:15:10,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107227 conditions, 28927 events. 21217/28927 cut-off events. For 116234/116234 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 158662 event pairs, 2361 based on Foata normal form. 1025/29952 useless extension candidates. Maximal degree in co-relation 107199. Up to 12656 conditions per place. [2023-08-30 23:15:10,373 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 73 selfloop transitions, 30 changer transitions 48/151 dead transitions. [2023-08-30 23:15:10,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 151 transitions, 1338 flow [2023-08-30 23:15:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-08-30 23:15:10,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024009603841537 [2023-08-30 23:15:10,377 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-08-30 23:15:10,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-08-30 23:15:10,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:10,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-08-30 23:15:10,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:10,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:10,382 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:10,382 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 474 flow. Second operand 7 states and 837 transitions. [2023-08-30 23:15:10,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 151 transitions, 1338 flow [2023-08-30 23:15:10,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 151 transitions, 1304 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:10,839 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 762 flow [2023-08-30 23:15:10,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=762, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-08-30 23:15:10,840 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2023-08-30 23:15:10,840 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 762 flow [2023-08-30 23:15:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:10,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:10,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:10,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:15:10,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:10,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2006094894, now seen corresponding path program 1 times [2023-08-30 23:15:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056384129] [2023-08-30 23:15:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:10,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056384129] [2023-08-30 23:15:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056384129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582760883] [2023-08-30 23:15:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:11,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:15:11,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 762 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:11,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:11,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:15:11,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:14,893 INFO L130 PetriNetUnfolder]: 29071/39821 cut-off events. [2023-08-30 23:15:14,893 INFO L131 PetriNetUnfolder]: For 236172/236172 co-relation queries the response was YES. [2023-08-30 23:15:14,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157393 conditions, 39821 events. 29071/39821 cut-off events. For 236172/236172 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 232493 event pairs, 4679 based on Foata normal form. 1215/41036 useless extension candidates. Maximal degree in co-relation 157359. Up to 15116 conditions per place. [2023-08-30 23:15:15,063 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 73 selfloop transitions, 40 changer transitions 48/161 dead transitions. [2023-08-30 23:15:15,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 161 transitions, 1604 flow [2023-08-30 23:15:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-30 23:15:15,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-30 23:15:15,066 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-30 23:15:15,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-30 23:15:15,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:15,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-30 23:15:15,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:15,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:15,071 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:15,071 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 762 flow. Second operand 7 states and 840 transitions. [2023-08-30 23:15:15,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 161 transitions, 1604 flow [2023-08-30 23:15:15,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 161 transitions, 1580 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:15,745 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 1018 flow [2023-08-30 23:15:15,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1018, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-30 23:15:15,746 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-30 23:15:15,746 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 1018 flow [2023-08-30 23:15:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:15,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:15,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:15,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:15:15,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:15,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1483035696, now seen corresponding path program 1 times [2023-08-30 23:15:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:15,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476492664] [2023-08-30 23:15:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:16,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476492664] [2023-08-30 23:15:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476492664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:16,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:15:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139267457] [2023-08-30 23:15:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:16,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:15:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:15:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:15:16,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 238 [2023-08-30 23:15:16,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 1018 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:16,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:16,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 238 [2023-08-30 23:15:16,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:19,273 INFO L130 PetriNetUnfolder]: 21568/31022 cut-off events. [2023-08-30 23:15:19,273 INFO L131 PetriNetUnfolder]: For 250487/253682 co-relation queries the response was YES. [2023-08-30 23:15:19,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123145 conditions, 31022 events. 21568/31022 cut-off events. For 250487/253682 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 197146 event pairs, 5902 based on Foata normal form. 2222/33008 useless extension candidates. Maximal degree in co-relation 123105. Up to 19805 conditions per place. [2023-08-30 23:15:19,473 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 67 selfloop transitions, 6 changer transitions 30/125 dead transitions. [2023-08-30 23:15:19,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 1628 flow [2023-08-30 23:15:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:15:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:15:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-30 23:15:19,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260504201680672 [2023-08-30 23:15:19,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-30 23:15:19,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-30 23:15:19,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:19,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-30 23:15:19,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:19,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:19,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:19,481 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 1018 flow. Second operand 5 states and 626 transitions. [2023-08-30 23:15:19,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 1628 flow [2023-08-30 23:15:19,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1600 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 23:15:19,776 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 1022 flow [2023-08-30 23:15:19,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1022, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-30 23:15:19,776 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-30 23:15:19,776 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 1022 flow [2023-08-30 23:15:19,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:19,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:19,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:19,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:15:19,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:19,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1386653652, now seen corresponding path program 1 times [2023-08-30 23:15:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:19,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285033785] [2023-08-30 23:15:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:19,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285033785] [2023-08-30 23:15:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285033785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057363676] [2023-08-30 23:15:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:19,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:15:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:15:19,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:15:19,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 23:15:19,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 1022 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:19,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:19,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 23:15:19,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:22,225 INFO L130 PetriNetUnfolder]: 14095/20979 cut-off events. [2023-08-30 23:15:22,225 INFO L131 PetriNetUnfolder]: For 139926/144979 co-relation queries the response was YES. [2023-08-30 23:15:22,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78641 conditions, 20979 events. 14095/20979 cut-off events. For 139926/144979 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 140312 event pairs, 2447 based on Foata normal form. 2487/23254 useless extension candidates. Maximal degree in co-relation 78600. Up to 13504 conditions per place. [2023-08-30 23:15:22,315 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 155 selfloop transitions, 10 changer transitions 0/192 dead transitions. [2023-08-30 23:15:22,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 192 transitions, 2730 flow [2023-08-30 23:15:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:15:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:15:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-30 23:15:22,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2023-08-30 23:15:22,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-30 23:15:22,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-30 23:15:22,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:22,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-30 23:15:22,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:22,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:22,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:22,322 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 1022 flow. Second operand 5 states and 623 transitions. [2023-08-30 23:15:22,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 192 transitions, 2730 flow [2023-08-30 23:15:22,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 192 transitions, 2710 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 23:15:22,373 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 1077 flow [2023-08-30 23:15:22,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1077, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2023-08-30 23:15:22,374 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-30 23:15:22,374 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 1077 flow [2023-08-30 23:15:22,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:22,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:22,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:22,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:15:22,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:22,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1923842751, now seen corresponding path program 1 times [2023-08-30 23:15:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:22,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788989289] [2023-08-30 23:15:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788989289] [2023-08-30 23:15:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788989289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099090387] [2023-08-30 23:15:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:22,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:15:22,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 1077 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:22,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:22,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:15:22,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:26,663 INFO L130 PetriNetUnfolder]: 28885/41510 cut-off events. [2023-08-30 23:15:26,663 INFO L131 PetriNetUnfolder]: For 299023/299023 co-relation queries the response was YES. [2023-08-30 23:15:26,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195907 conditions, 41510 events. 28885/41510 cut-off events. For 299023/299023 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 271778 event pairs, 7489 based on Foata normal form. 612/42122 useless extension candidates. Maximal degree in co-relation 195866. Up to 16984 conditions per place. [2023-08-30 23:15:26,841 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 93 selfloop transitions, 36 changer transitions 72/201 dead transitions. [2023-08-30 23:15:26,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 201 transitions, 2448 flow [2023-08-30 23:15:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-30 23:15:26,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018007202881153 [2023-08-30 23:15:26,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-30 23:15:26,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-30 23:15:26,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:26,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-30 23:15:26,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:26,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:26,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:26,849 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 1077 flow. Second operand 7 states and 836 transitions. [2023-08-30 23:15:26,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 201 transitions, 2448 flow [2023-08-30 23:15:27,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 201 transitions, 2431 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 23:15:27,128 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 1273 flow [2023-08-30 23:15:27,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1273, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2023-08-30 23:15:27,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2023-08-30 23:15:27,129 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 1273 flow [2023-08-30 23:15:27,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:27,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:27,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:27,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:15:27,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:27,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash -684657053, now seen corresponding path program 1 times [2023-08-30 23:15:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925360734] [2023-08-30 23:15:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925360734] [2023-08-30 23:15:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925360734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99588168] [2023-08-30 23:15:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:27,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 23:15:27,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 1273 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:27,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:27,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 23:15:27,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:29,143 INFO L130 PetriNetUnfolder]: 9904/15637 cut-off events. [2023-08-30 23:15:29,143 INFO L131 PetriNetUnfolder]: For 115984/118524 co-relation queries the response was YES. [2023-08-30 23:15:29,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66175 conditions, 15637 events. 9904/15637 cut-off events. For 115984/118524 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 110365 event pairs, 1334 based on Foata normal form. 2130/17553 useless extension candidates. Maximal degree in co-relation 66127. Up to 5993 conditions per place. [2023-08-30 23:15:29,207 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 172 selfloop transitions, 14 changer transitions 9/222 dead transitions. [2023-08-30 23:15:29,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 222 transitions, 3593 flow [2023-08-30 23:15:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-30 23:15:29,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2023-08-30 23:15:29,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-30 23:15:29,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-30 23:15:29,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:29,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-30 23:15:29,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:29,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:29,213 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:29,214 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 1273 flow. Second operand 6 states and 750 transitions. [2023-08-30 23:15:29,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 222 transitions, 3593 flow [2023-08-30 23:15:29,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 222 transitions, 3571 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-30 23:15:29,405 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 1379 flow [2023-08-30 23:15:29,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1379, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2023-08-30 23:15:29,406 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2023-08-30 23:15:29,406 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 1379 flow [2023-08-30 23:15:29,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:29,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:29,406 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-08-30 23:15:29,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:15:29,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:29,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1580143778, now seen corresponding path program 1 times [2023-08-30 23:15:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:29,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019449251] [2023-08-30 23:15:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:29,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019449251] [2023-08-30 23:15:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019449251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:15:29,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306136468] [2023-08-30 23:15:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:29,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:15:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:15:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:15:29,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 23:15:29,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 1379 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:29,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:29,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 23:15:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:31,686 INFO L130 PetriNetUnfolder]: 8657/13722 cut-off events. [2023-08-30 23:15:31,686 INFO L131 PetriNetUnfolder]: For 104103/106247 co-relation queries the response was YES. [2023-08-30 23:15:31,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66532 conditions, 13722 events. 8657/13722 cut-off events. For 104103/106247 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 96531 event pairs, 936 based on Foata normal form. 1143/14663 useless extension candidates. Maximal degree in co-relation 66482. Up to 5520 conditions per place. [2023-08-30 23:15:31,737 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 173 selfloop transitions, 23 changer transitions 43/265 dead transitions. [2023-08-30 23:15:31,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 265 transitions, 4285 flow [2023-08-30 23:15:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:15:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:15:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 999 transitions. [2023-08-30 23:15:31,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246848739495799 [2023-08-30 23:15:31,740 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 999 transitions. [2023-08-30 23:15:31,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 999 transitions. [2023-08-30 23:15:31,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:31,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 999 transitions. [2023-08-30 23:15:31,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:31,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:31,746 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:31,746 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 1379 flow. Second operand 8 states and 999 transitions. [2023-08-30 23:15:31,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 265 transitions, 4285 flow [2023-08-30 23:15:32,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 265 transitions, 4227 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-30 23:15:32,700 INFO L231 Difference]: Finished difference. Result has 94 places, 99 transitions, 1443 flow [2023-08-30 23:15:32,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1443, PETRI_PLACES=94, PETRI_TRANSITIONS=99} [2023-08-30 23:15:32,701 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-08-30 23:15:32,701 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 1443 flow [2023-08-30 23:15:32,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:32,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:32,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:32,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:15:32,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:32,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 994775255, now seen corresponding path program 1 times [2023-08-30 23:15:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:32,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564072224] [2023-08-30 23:15:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:32,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564072224] [2023-08-30 23:15:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564072224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:33,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:33,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:15:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409863553] [2023-08-30 23:15:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:15:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:15:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:15:33,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-30 23:15:33,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 1443 flow. Second operand has 7 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:33,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:33,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-30 23:15:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:34,456 INFO L130 PetriNetUnfolder]: 8324/13193 cut-off events. [2023-08-30 23:15:34,456 INFO L131 PetriNetUnfolder]: For 103560/105475 co-relation queries the response was YES. [2023-08-30 23:15:34,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64230 conditions, 13193 events. 8324/13193 cut-off events. For 103560/105475 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 93173 event pairs, 890 based on Foata normal form. 687/13675 useless extension candidates. Maximal degree in co-relation 64179. Up to 3442 conditions per place. [2023-08-30 23:15:34,522 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 96 selfloop transitions, 26 changer transitions 128/260 dead transitions. [2023-08-30 23:15:34,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 260 transitions, 4175 flow [2023-08-30 23:15:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:15:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:15:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2023-08-30 23:15:34,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-08-30 23:15:34,525 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2023-08-30 23:15:34,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2023-08-30 23:15:34,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:34,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2023-08-30 23:15:34,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:34,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:34,531 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:34,531 INFO L175 Difference]: Start difference. First operand has 94 places, 99 transitions, 1443 flow. Second operand 10 states and 1220 transitions. [2023-08-30 23:15:34,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 260 transitions, 4175 flow [2023-08-30 23:15:35,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 260 transitions, 3989 flow, removed 80 selfloop flow, removed 8 redundant places. [2023-08-30 23:15:35,971 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 756 flow [2023-08-30 23:15:35,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=756, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2023-08-30 23:15:35,972 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-30 23:15:35,972 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 756 flow [2023-08-30 23:15:35,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:35,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:35,973 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] [2023-08-30 23:15:35,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:15:35,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:35,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1449397436, now seen corresponding path program 1 times [2023-08-30 23:15:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98342429] [2023-08-30 23:15:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98342429] [2023-08-30 23:15:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98342429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:15:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594088635] [2023-08-30 23:15:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:37,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:15:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:15:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:15:37,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-08-30 23:15:37,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 65 transitions, 756 flow. Second operand has 9 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:37,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:37,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-08-30 23:15:37,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:37,941 INFO L130 PetriNetUnfolder]: 2408/3812 cut-off events. [2023-08-30 23:15:37,942 INFO L131 PetriNetUnfolder]: For 36862/36862 co-relation queries the response was YES. [2023-08-30 23:15:37,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20012 conditions, 3812 events. 2408/3812 cut-off events. For 36862/36862 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20337 event pairs, 164 based on Foata normal form. 1/3813 useless extension candidates. Maximal degree in co-relation 19962. Up to 1727 conditions per place. [2023-08-30 23:15:37,960 INFO L137 encePairwiseOnDemand]: 224/238 looper letters, 64 selfloop transitions, 23 changer transitions 99/186 dead transitions. [2023-08-30 23:15:37,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 186 transitions, 2243 flow [2023-08-30 23:15:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:15:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:15:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1092 transitions. [2023-08-30 23:15:37,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2023-08-30 23:15:37,964 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1092 transitions. [2023-08-30 23:15:37,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1092 transitions. [2023-08-30 23:15:37,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:37,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1092 transitions. [2023-08-30 23:15:37,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 109.2) internal successors, (1092), 10 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:37,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:37,970 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:37,970 INFO L175 Difference]: Start difference. First operand has 98 places, 65 transitions, 756 flow. Second operand 10 states and 1092 transitions. [2023-08-30 23:15:37,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 186 transitions, 2243 flow [2023-08-30 23:15:38,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 186 transitions, 1662 flow, removed 68 selfloop flow, removed 25 redundant places. [2023-08-30 23:15:38,033 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 513 flow [2023-08-30 23:15:38,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=513, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2023-08-30 23:15:38,033 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-30 23:15:38,033 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 513 flow [2023-08-30 23:15:38,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:38,034 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] [2023-08-30 23:15:38,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:15:38,034 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:38,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash -192029870, now seen corresponding path program 2 times [2023-08-30 23:15:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690109711] [2023-08-30 23:15:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:38,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:38,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690109711] [2023-08-30 23:15:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690109711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:38,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981419002] [2023-08-30 23:15:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:38,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:15:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:15:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:15:38,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:15:38,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 58 transitions, 513 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:38,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:15:38,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:38,504 INFO L130 PetriNetUnfolder]: 680/1187 cut-off events. [2023-08-30 23:15:38,504 INFO L131 PetriNetUnfolder]: For 3438/3468 co-relation queries the response was YES. [2023-08-30 23:15:38,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1187 events. 680/1187 cut-off events. For 3438/3468 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5622 event pairs, 280 based on Foata normal form. 14/1184 useless extension candidates. Maximal degree in co-relation 4443. Up to 712 conditions per place. [2023-08-30 23:15:38,509 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 44 selfloop transitions, 2 changer transitions 35/84 dead transitions. [2023-08-30 23:15:38,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 805 flow [2023-08-30 23:15:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:15:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:15:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-30 23:15:38,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-30 23:15:38,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-30 23:15:38,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-30 23:15:38,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:38,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-30 23:15:38,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,514 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,514 INFO L175 Difference]: Start difference. First operand has 85 places, 58 transitions, 513 flow. Second operand 4 states and 490 transitions. [2023-08-30 23:15:38,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 805 flow [2023-08-30 23:15:38,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 766 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-30 23:15:38,525 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 262 flow [2023-08-30 23:15:38,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2023-08-30 23:15:38,526 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-08-30 23:15:38,526 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 262 flow [2023-08-30 23:15:38,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:38,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:38,526 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] [2023-08-30 23:15:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:15:38,527 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:38,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 722837822, now seen corresponding path program 3 times [2023-08-30 23:15:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187162242] [2023-08-30 23:15:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:38,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:15:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:38,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:15:38,644 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:15:38,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:15:38,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:15:38,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:15:38,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:15:38,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:15:38,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:15:38,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:15:38,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:15:38,648 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:38,653 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:15:38,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:15:38,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:15:38 BasicIcfg [2023-08-30 23:15:38,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:15:38,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:15:38,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:15:38,748 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:15:38,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:53" (3/4) ... [2023-08-30 23:15:38,750 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:15:38,835 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:15:38,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:15:38,836 INFO L158 Benchmark]: Toolchain (without parser) took 46746.73ms. Allocated memory was 90.2MB in the beginning and 11.5GB in the end (delta: 11.5GB). Free memory was 65.5MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-08-30 23:15:38,836 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:15:38,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.09ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 67.5MB in the end (delta: -2.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2023-08-30 23:15:38,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.69ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 64.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:38,837 INFO L158 Benchmark]: Boogie Preprocessor took 24.99ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 62.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:38,837 INFO L158 Benchmark]: RCFGBuilder took 724.66ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 58.8MB in the end (delta: 3.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2023-08-30 23:15:38,838 INFO L158 Benchmark]: TraceAbstraction took 45349.81ms. Allocated memory was 90.2MB in the beginning and 11.5GB in the end (delta: 11.5GB). Free memory was 58.3MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-08-30 23:15:38,838 INFO L158 Benchmark]: Witness Printer took 88.14ms. Allocated memory is still 11.5GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:15:38,839 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.18ms. Allocated memory is still 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.09ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 67.5MB in the end (delta: -2.3MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.69ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 64.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.99ms. Allocated memory is still 90.2MB. Free memory was 64.8MB in the beginning and 62.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 724.66ms. Allocated memory is still 90.2MB. Free memory was 62.8MB in the beginning and 58.8MB in the end (delta: 3.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45349.81ms. Allocated memory was 90.2MB in the beginning and 11.5GB in the end (delta: 11.5GB). Free memory was 58.3MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 88.14ms. Allocated memory is still 11.5GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 138 PlacesBefore, 44 PlacesAfterwards, 127 TransitionsBefore, 32 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 8526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3524, independent: 3316, independent conditional: 0, independent unconditional: 3316, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1703, independent: 1671, independent conditional: 0, independent unconditional: 1671, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3524, independent: 1645, independent conditional: 0, independent unconditional: 1645, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1703, unknown conditional: 0, unknown unconditional: 1703] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=-3, t1249={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=-2, t1249={5:0}, t1250={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1251; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=-1, t1249={5:0}, t1250={6:0}, t1251={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice2=1, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 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: 45.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1115 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 942 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2314 IncrementalHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 125 mSDtfsCounter, 2314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=11, InterpolantAutomatonStates: 91, 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, 3.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:15:38,873 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