./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.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 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:52:48,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:52:48,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:52:48,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:52:48,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:52:48,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:52:48,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:52:48,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:52:48,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:52:48,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:52:48,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:52:48,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:52:48,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:52:48,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:52:48,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:52:48,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:52:48,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:52:48,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:52:48,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:52:48,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:52:48,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:52:48,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:52:48,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:52:48,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:52:48,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:52:48,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:52:48,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:52:48,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:52:48,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:52:48,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:52:48,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:52:48,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:52:48,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:52:48,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:52:48,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:52:48,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:52:48,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:52:48,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:52:48,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:52:48,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:52:48,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:52:48,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:52:48,577 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:52:48,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:52:48,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:52:48,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:52:48,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:52:48,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:52:48,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:52:48,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:52:48,581 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:52:48,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:52:48,582 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:52:48,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:52:48,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:52:48,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:52:48,584 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:52:48,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:52:48,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:52:48,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:52:48,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:52:48,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:48,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:52:48,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:52:48,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:52:48,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:52:48,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:52:48,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:52:48,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:52:48,586 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:52:48,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:52:48,586 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:52:48,587 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 -> 9ec75f624fee0326f6dc01ebf4c0afe8f65e83cfa5c5726cd79e55765f7366f9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:52:48,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:52:48,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:52:48,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:52:48,893 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:52:48,893 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:52:48,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-30 16:52:50,042 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:52:50,290 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:52:50,290 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-30 16:52:50,319 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26221667/aa87c3030f4f44c4bc98684132e86672/FLAG0dd90165d [2023-08-30 16:52:50,341 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26221667/aa87c3030f4f44c4bc98684132e86672 [2023-08-30 16:52:50,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:52:50,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:52:50,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:50,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:52:50,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:52:50,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a41573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50, skipping insertion in model container [2023-08-30 16:52:50,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:52:50,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:52:50,531 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/mix055_tso.oepc.i[949,962] [2023-08-30 16:52:50,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:50,695 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:52:50,711 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/mix055_tso.oepc.i[949,962] [2023-08-30 16:52:50,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:50,820 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:50,820 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:50,826 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:52:50,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50 WrapperNode [2023-08-30 16:52:50,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:50,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:50,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:52:50,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:52:50,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,905 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-30 16:52:50,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:50,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:52:50,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:52:50,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:52:50,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:52:50,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:52:50,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:52:50,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:52:50,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:52:50,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:52:51,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:52:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:52:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:52:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:52:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:52:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:52:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:52:51,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:52:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:52:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:52:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:52:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:52:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:52:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:52:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:52:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:52:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:52:51,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:52:51,043 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:52:51,161 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:52:51,163 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:52:51,593 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:52:51,756 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:52:51,756 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:52:51,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51 BoogieIcfgContainer [2023-08-30 16:52:51,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:52:51,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:52:51,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:52:51,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:52:51,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:52:50" (1/3) ... [2023-08-30 16:52:51,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdbc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:51, skipping insertion in model container [2023-08-30 16:52:51,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (2/3) ... [2023-08-30 16:52:51,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdbc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:51, skipping insertion in model container [2023-08-30 16:52:51,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51" (3/3) ... [2023-08-30 16:52:51,768 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-08-30 16:52:51,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:52:51,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:52:51,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:52:51,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:52:51,846 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:52:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-30 16:52:51,954 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:52:51,954 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:51,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:51,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-30 16:52:51,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:51,967 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:52:51,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:51,977 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:51,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:52,006 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:52:52,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:52,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 3044 [2023-08-30 16:52:55,721 INFO L134 LiptonReduction]: Checked pairs total: 8921 [2023-08-30 16:52:55,722 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-30 16:52:55,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:52:55,738 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;@3085a18, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:52:55,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:52:55,743 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:52:55,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:55,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:55,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:52:55,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:55,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 517905549, now seen corresponding path program 1 times [2023-08-30 16:52:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343731204] [2023-08-30 16:52:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343731204] [2023-08-30 16:52:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343731204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:52:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483896183] [2023-08-30 16:52:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:52:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:52:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:52:56,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 233 [2023-08-30 16:52:56,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:56,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:56,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 233 [2023-08-30 16:52:56,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:57,204 INFO L130 PetriNetUnfolder]: 5463/7958 cut-off events. [2023-08-30 16:52:57,204 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 16:52:57,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 7958 events. 5463/7958 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47267 event pairs, 1005 based on Foata normal form. 256/7685 useless extension candidates. Maximal degree in co-relation 15546. Up to 5923 conditions per place. [2023-08-30 16:52:57,246 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-30 16:52:57,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-08-30 16:52:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:52:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:52:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 16:52:57,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493562231759657 [2023-08-30 16:52:57,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:57,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:57,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:57,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:57,275 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 384 transitions. [2023-08-30 16:52:57,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-08-30 16:52:57,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:52:57,280 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 16:52:57,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 16:52:57,285 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 16:52:57,286 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 16:52:57,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:57,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:57,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:57,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:52:57,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:57,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1725633849, now seen corresponding path program 1 times [2023-08-30 16:52:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394246847] [2023-08-30 16:52:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394246847] [2023-08-30 16:52:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394246847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:52:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634225057] [2023-08-30 16:52:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:57,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:57,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 233 [2023-08-30 16:52:57,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:57,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:57,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 233 [2023-08-30 16:52:57,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:58,629 INFO L130 PetriNetUnfolder]: 5447/7784 cut-off events. [2023-08-30 16:52:58,631 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2023-08-30 16:52:58,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16006 conditions, 7784 events. 5447/7784 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 42032 event pairs, 1399 based on Foata normal form. 320/8100 useless extension candidates. Maximal degree in co-relation 15996. Up to 5953 conditions per place. [2023-08-30 16:52:58,727 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 35 selfloop transitions, 3 changer transitions 23/64 dead transitions. [2023-08-30 16:52:58,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 270 flow [2023-08-30 16:52:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:52:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:52:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-30 16:52:58,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-08-30 16:52:58,731 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-30 16:52:58,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-30 16:52:58,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:58,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-30 16:52:58,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:58,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:58,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:58,738 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 608 transitions. [2023-08-30 16:52:58,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 270 flow [2023-08-30 16:52:58,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:58,740 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-08-30 16:52:58,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-30 16:52:58,741 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-08-30 16:52:58,741 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-08-30 16:52:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:58,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:58,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:58,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:52:58,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:58,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1955012510, now seen corresponding path program 1 times [2023-08-30 16:52:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142719994] [2023-08-30 16:52:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:59,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:59,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142719994] [2023-08-30 16:52:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142719994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:59,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:52:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668926902] [2023-08-30 16:52:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:52:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:52:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:52:59,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 16:52:59,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:59,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:59,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 16:52:59,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:00,913 INFO L130 PetriNetUnfolder]: 10246/14032 cut-off events. [2023-08-30 16:53:00,913 INFO L131 PetriNetUnfolder]: For 4213/4218 co-relation queries the response was YES. [2023-08-30 16:53:00,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31441 conditions, 14032 events. 10246/14032 cut-off events. For 4213/4218 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 69970 event pairs, 4111 based on Foata normal form. 582/14612 useless extension candidates. Maximal degree in co-relation 31428. Up to 11872 conditions per place. [2023-08-30 16:53:01,007 INFO L137 encePairwiseOnDemand]: 222/233 looper letters, 48 selfloop transitions, 13 changer transitions 32/95 dead transitions. [2023-08-30 16:53:01,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 449 flow [2023-08-30 16:53:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-30 16:53:01,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076640098099325 [2023-08-30 16:53:01,011 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-30 16:53:01,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-30 16:53:01,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:01,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-30 16:53:01,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:01,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:01,017 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:01,017 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 7 states and 828 transitions. [2023-08-30 16:53:01,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 449 flow [2023-08-30 16:53:01,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 442 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:01,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 192 flow [2023-08-30 16:53:01,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-30 16:53:01,028 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-30 16:53:01,028 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 192 flow [2023-08-30 16:53:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:01,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:01,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:53:01,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:01,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1141854111, now seen corresponding path program 1 times [2023-08-30 16:53:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724046761] [2023-08-30 16:53:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:01,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724046761] [2023-08-30 16:53:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724046761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:01,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375133240] [2023-08-30 16:53:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:01,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:01,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 233 [2023-08-30 16:53:01,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:01,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:01,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 233 [2023-08-30 16:53:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:03,240 INFO L130 PetriNetUnfolder]: 7522/10631 cut-off events. [2023-08-30 16:53:03,240 INFO L131 PetriNetUnfolder]: For 18076/18292 co-relation queries the response was YES. [2023-08-30 16:53:03,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31552 conditions, 10631 events. 7522/10631 cut-off events. For 18076/18292 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 57808 event pairs, 2973 based on Foata normal form. 488/10884 useless extension candidates. Maximal degree in co-relation 31534. Up to 8015 conditions per place. [2023-08-30 16:53:03,324 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 62 selfloop transitions, 9 changer transitions 33/109 dead transitions. [2023-08-30 16:53:03,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 658 flow [2023-08-30 16:53:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 16:53:03,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248313917841815 [2023-08-30 16:53:03,332 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 16:53:03,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 16:53:03,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:03,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 16:53:03,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:03,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:03,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:03,339 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 192 flow. Second operand 7 states and 856 transitions. [2023-08-30 16:53:03,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 658 flow [2023-08-30 16:53:03,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 656 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:03,379 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 273 flow [2023-08-30 16:53:03,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-30 16:53:03,381 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-08-30 16:53:03,381 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 273 flow [2023-08-30 16:53:03,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:03,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:03,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:03,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:53:03,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:03,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1945803378, now seen corresponding path program 1 times [2023-08-30 16:53:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725424362] [2023-08-30 16:53:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:03,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:03,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725424362] [2023-08-30 16:53:03,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725424362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:03,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:03,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928555337] [2023-08-30 16:53:03,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:03,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:03,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 233 [2023-08-30 16:53:03,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:03,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:03,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 233 [2023-08-30 16:53:03,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:05,075 INFO L130 PetriNetUnfolder]: 7219/10336 cut-off events. [2023-08-30 16:53:05,076 INFO L131 PetriNetUnfolder]: For 33018/33303 co-relation queries the response was YES. [2023-08-30 16:53:05,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37833 conditions, 10336 events. 7219/10336 cut-off events. For 33018/33303 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 57099 event pairs, 2192 based on Foata normal form. 419/10570 useless extension candidates. Maximal degree in co-relation 37809. Up to 7377 conditions per place. [2023-08-30 16:53:05,184 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 64 selfloop transitions, 14 changer transitions 28/111 dead transitions. [2023-08-30 16:53:05,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 807 flow [2023-08-30 16:53:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2023-08-30 16:53:05,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272838749233599 [2023-08-30 16:53:05,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2023-08-30 16:53:05,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2023-08-30 16:53:05,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:05,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2023-08-30 16:53:05,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,193 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,193 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 273 flow. Second operand 7 states and 860 transitions. [2023-08-30 16:53:05,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 807 flow [2023-08-30 16:53:05,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 793 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:05,308 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 349 flow [2023-08-30 16:53:05,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-08-30 16:53:05,309 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-08-30 16:53:05,309 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 349 flow [2023-08-30 16:53:05,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:05,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:05,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:53:05,310 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:05,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2001577274, now seen corresponding path program 1 times [2023-08-30 16:53:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357776657] [2023-08-30 16:53:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357776657] [2023-08-30 16:53:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357776657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181571209] [2023-08-30 16:53:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:05,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:05,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 233 [2023-08-30 16:53:05,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:05,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 233 [2023-08-30 16:53:05,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:07,214 INFO L130 PetriNetUnfolder]: 6856/9760 cut-off events. [2023-08-30 16:53:07,215 INFO L131 PetriNetUnfolder]: For 50433/50705 co-relation queries the response was YES. [2023-08-30 16:53:07,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40401 conditions, 9760 events. 6856/9760 cut-off events. For 50433/50705 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 52807 event pairs, 1886 based on Foata normal form. 379/9930 useless extension candidates. Maximal degree in co-relation 40372. Up to 7209 conditions per place. [2023-08-30 16:53:07,304 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 70 selfloop transitions, 8 changer transitions 20/103 dead transitions. [2023-08-30 16:53:07,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 829 flow [2023-08-30 16:53:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:53:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:53:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2023-08-30 16:53:07,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236051502145923 [2023-08-30 16:53:07,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 732 transitions. [2023-08-30 16:53:07,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 732 transitions. [2023-08-30 16:53:07,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:07,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 732 transitions. [2023-08-30 16:53:07,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:07,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:07,312 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:07,312 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 349 flow. Second operand 6 states and 732 transitions. [2023-08-30 16:53:07,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 829 flow [2023-08-30 16:53:07,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 802 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 16:53:07,418 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 352 flow [2023-08-30 16:53:07,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-30 16:53:07,421 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2023-08-30 16:53:07,421 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 352 flow [2023-08-30 16:53:07,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:07,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:07,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:07,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:53:07,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:07,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 149202517, now seen corresponding path program 1 times [2023-08-30 16:53:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421135288] [2023-08-30 16:53:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:07,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:07,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421135288] [2023-08-30 16:53:07,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421135288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:07,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:07,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888981385] [2023-08-30 16:53:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:07,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:07,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:08,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:08,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:08,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:08,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:08,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:09,387 INFO L130 PetriNetUnfolder]: 6964/9948 cut-off events. [2023-08-30 16:53:09,387 INFO L131 PetriNetUnfolder]: For 51455/51765 co-relation queries the response was YES. [2023-08-30 16:53:09,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41265 conditions, 9948 events. 6964/9948 cut-off events. For 51455/51765 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 54472 event pairs, 2109 based on Foata normal form. 346/10107 useless extension candidates. Maximal degree in co-relation 41234. Up to 7317 conditions per place. [2023-08-30 16:53:09,487 INFO L137 encePairwiseOnDemand]: 223/233 looper letters, 72 selfloop transitions, 22 changer transitions 11/110 dead transitions. [2023-08-30 16:53:09,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 868 flow [2023-08-30 16:53:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:53:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:53:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-30 16:53:09,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522889842632332 [2023-08-30 16:53:09,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-30 16:53:09,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-30 16:53:09,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:09,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-30 16:53:09,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,497 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,497 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 352 flow. Second operand 6 states and 731 transitions. [2023-08-30 16:53:09,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 868 flow [2023-08-30 16:53:09,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 848 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 16:53:09,662 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 497 flow [2023-08-30 16:53:09,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-08-30 16:53:09,663 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2023-08-30 16:53:09,664 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 497 flow [2023-08-30 16:53:09,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:09,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:09,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:53:09,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:09,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 192966457, now seen corresponding path program 2 times [2023-08-30 16:53:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:09,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984888725] [2023-08-30 16:53:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984888725] [2023-08-30 16:53:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984888725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:10,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558266402] [2023-08-30 16:53:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:10,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:10,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:10,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-30 16:53:10,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:10,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:10,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-30 16:53:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:12,137 INFO L130 PetriNetUnfolder]: 13093/17719 cut-off events. [2023-08-30 16:53:12,138 INFO L131 PetriNetUnfolder]: For 90498/90498 co-relation queries the response was YES. [2023-08-30 16:53:12,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78619 conditions, 17719 events. 13093/17719 cut-off events. For 90498/90498 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 88088 event pairs, 2721 based on Foata normal form. 473/18192 useless extension candidates. Maximal degree in co-relation 78588. Up to 12262 conditions per place. [2023-08-30 16:53:12,297 INFO L137 encePairwiseOnDemand]: 219/233 looper letters, 115 selfloop transitions, 72 changer transitions 31/218 dead transitions. [2023-08-30 16:53:12,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 218 transitions, 1866 flow [2023-08-30 16:53:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:53:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:53:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2023-08-30 16:53:12,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48884120171673817 [2023-08-30 16:53:12,301 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2023-08-30 16:53:12,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2023-08-30 16:53:12,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:12,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2023-08-30 16:53:12,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,310 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,310 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 497 flow. Second operand 10 states and 1139 transitions. [2023-08-30 16:53:12,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 218 transitions, 1866 flow [2023-08-30 16:53:12,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 218 transitions, 1820 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:12,519 INFO L231 Difference]: Finished difference. Result has 81 places, 113 transitions, 1264 flow [2023-08-30 16:53:12,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1264, PETRI_PLACES=81, PETRI_TRANSITIONS=113} [2023-08-30 16:53:12,521 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-30 16:53:12,521 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 113 transitions, 1264 flow [2023-08-30 16:53:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:12,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:53:12,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:12,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1656708683, now seen corresponding path program 3 times [2023-08-30 16:53:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345730908] [2023-08-30 16:53:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345730908] [2023-08-30 16:53:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345730908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:12,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:12,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058492411] [2023-08-30 16:53:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:12,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:13,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-30 16:53:13,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 113 transitions, 1264 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:13,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:13,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-30 16:53:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:14,740 INFO L130 PetriNetUnfolder]: 12271/17059 cut-off events. [2023-08-30 16:53:14,740 INFO L131 PetriNetUnfolder]: For 176279/177563 co-relation queries the response was YES. [2023-08-30 16:53:14,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100309 conditions, 17059 events. 12271/17059 cut-off events. For 176279/177563 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 93173 event pairs, 2646 based on Foata normal form. 759/17267 useless extension candidates. Maximal degree in co-relation 100270. Up to 10117 conditions per place. [2023-08-30 16:53:14,926 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 118 selfloop transitions, 35 changer transitions 28/198 dead transitions. [2023-08-30 16:53:14,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 198 transitions, 2454 flow [2023-08-30 16:53:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-08-30 16:53:14,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174739423666462 [2023-08-30 16:53:14,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-08-30 16:53:14,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-08-30 16:53:14,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:14,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-08-30 16:53:14,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,941 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,941 INFO L175 Difference]: Start difference. First operand has 81 places, 113 transitions, 1264 flow. Second operand 7 states and 844 transitions. [2023-08-30 16:53:14,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 198 transitions, 2454 flow [2023-08-30 16:53:15,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 198 transitions, 2212 flow, removed 90 selfloop flow, removed 4 redundant places. [2023-08-30 16:53:15,319 INFO L231 Difference]: Finished difference. Result has 84 places, 121 transitions, 1362 flow [2023-08-30 16:53:15,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1362, PETRI_PLACES=84, PETRI_TRANSITIONS=121} [2023-08-30 16:53:15,320 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-08-30 16:53:15,320 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 1362 flow [2023-08-30 16:53:15,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:15,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:15,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:15,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:53:15,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:15,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 374177350, now seen corresponding path program 1 times [2023-08-30 16:53:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538621338] [2023-08-30 16:53:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:15,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538621338] [2023-08-30 16:53:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538621338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166474225] [2023-08-30 16:53:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:15,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:15,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:15,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 121 transitions, 1362 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:15,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:15,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:16,694 INFO L130 PetriNetUnfolder]: 6953/9895 cut-off events. [2023-08-30 16:53:16,694 INFO L131 PetriNetUnfolder]: For 145628/147969 co-relation queries the response was YES. [2023-08-30 16:53:16,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64511 conditions, 9895 events. 6953/9895 cut-off events. For 145628/147969 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 53641 event pairs, 1293 based on Foata normal form. 579/10023 useless extension candidates. Maximal degree in co-relation 64469. Up to 7461 conditions per place. [2023-08-30 16:53:16,771 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 143 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2023-08-30 16:53:16,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 170 transitions, 2235 flow [2023-08-30 16:53:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-30 16:53:16,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525035765379113 [2023-08-30 16:53:16,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-30 16:53:16,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-30 16:53:16,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:16,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-30 16:53:16,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,776 INFO L175 Difference]: Start difference. First operand has 84 places, 121 transitions, 1362 flow. Second operand 3 states and 367 transitions. [2023-08-30 16:53:16,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 170 transitions, 2235 flow [2023-08-30 16:53:16,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 170 transitions, 2074 flow, removed 49 selfloop flow, removed 4 redundant places. [2023-08-30 16:53:16,918 INFO L231 Difference]: Finished difference. Result has 81 places, 119 transitions, 1244 flow [2023-08-30 16:53:16,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=81, PETRI_TRANSITIONS=119} [2023-08-30 16:53:16,919 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-30 16:53:16,919 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 119 transitions, 1244 flow [2023-08-30 16:53:16,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:16,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:16,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:53:16,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:16,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -135853254, now seen corresponding path program 1 times [2023-08-30 16:53:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042441387] [2023-08-30 16:53:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:17,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:17,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042441387] [2023-08-30 16:53:17,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042441387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:17,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:17,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677283797] [2023-08-30 16:53:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:17,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:17,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:17,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 119 transitions, 1244 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:17,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:17,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:17,691 INFO L130 PetriNetUnfolder]: 3418/5149 cut-off events. [2023-08-30 16:53:17,691 INFO L131 PetriNetUnfolder]: For 58793/59807 co-relation queries the response was YES. [2023-08-30 16:53:17,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31822 conditions, 5149 events. 3418/5149 cut-off events. For 58793/59807 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 27406 event pairs, 515 based on Foata normal form. 517/5484 useless extension candidates. Maximal degree in co-relation 31780. Up to 2537 conditions per place. [2023-08-30 16:53:17,731 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 170 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-08-30 16:53:17,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 200 transitions, 2487 flow [2023-08-30 16:53:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:53:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:53:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-30 16:53:17,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526824034334764 [2023-08-30 16:53:17,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-30 16:53:17,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-30 16:53:17,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:17,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-30 16:53:17,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:17,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:17,738 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:17,738 INFO L175 Difference]: Start difference. First operand has 81 places, 119 transitions, 1244 flow. Second operand 4 states and 491 transitions. [2023-08-30 16:53:17,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 200 transitions, 2487 flow [2023-08-30 16:53:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 2370 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-30 16:53:17,810 INFO L231 Difference]: Finished difference. Result has 81 places, 116 transitions, 1168 flow [2023-08-30 16:53:17,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1168, PETRI_PLACES=81, PETRI_TRANSITIONS=116} [2023-08-30 16:53:17,811 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-30 16:53:17,811 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 116 transitions, 1168 flow [2023-08-30 16:53:17,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:17,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:17,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:17,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:53:17,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:17,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash -496757863, now seen corresponding path program 1 times [2023-08-30 16:53:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825958102] [2023-08-30 16:53:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825958102] [2023-08-30 16:53:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825958102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619708098] [2023-08-30 16:53:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:18,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2023-08-30 16:53:18,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 116 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:18,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:18,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2023-08-30 16:53:18,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:19,667 INFO L130 PetriNetUnfolder]: 5867/8797 cut-off events. [2023-08-30 16:53:19,667 INFO L131 PetriNetUnfolder]: For 63479/63591 co-relation queries the response was YES. [2023-08-30 16:53:19,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50770 conditions, 8797 events. 5867/8797 cut-off events. For 63479/63591 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 48405 event pairs, 750 based on Foata normal form. 176/8966 useless extension candidates. Maximal degree in co-relation 50729. Up to 3994 conditions per place. [2023-08-30 16:53:19,731 INFO L137 encePairwiseOnDemand]: 219/233 looper letters, 157 selfloop transitions, 62 changer transitions 52/277 dead transitions. [2023-08-30 16:53:19,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 277 transitions, 3222 flow [2023-08-30 16:53:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 797 transitions. [2023-08-30 16:53:19,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48865726548129984 [2023-08-30 16:53:19,734 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 797 transitions. [2023-08-30 16:53:19,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 797 transitions. [2023-08-30 16:53:19,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:19,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 797 transitions. [2023-08-30 16:53:19,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,740 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,740 INFO L175 Difference]: Start difference. First operand has 81 places, 116 transitions, 1168 flow. Second operand 7 states and 797 transitions. [2023-08-30 16:53:19,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 277 transitions, 3222 flow [2023-08-30 16:53:19,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 277 transitions, 3164 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:19,820 INFO L231 Difference]: Finished difference. Result has 89 places, 142 transitions, 1682 flow [2023-08-30 16:53:19,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1682, PETRI_PLACES=89, PETRI_TRANSITIONS=142} [2023-08-30 16:53:19,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2023-08-30 16:53:19,821 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 142 transitions, 1682 flow [2023-08-30 16:53:19,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:19,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:19,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:53:19,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:19,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1885198013, now seen corresponding path program 2 times [2023-08-30 16:53:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:19,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226340916] [2023-08-30 16:53:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226340916] [2023-08-30 16:53:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226340916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630291748] [2023-08-30 16:53:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:20,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:20,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 233 [2023-08-30 16:53:20,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 142 transitions, 1682 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 16:53:20,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:20,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 233 [2023-08-30 16:53:20,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:21,327 INFO L130 PetriNetUnfolder]: 6538/10323 cut-off events. [2023-08-30 16:53:21,327 INFO L131 PetriNetUnfolder]: For 96660/97262 co-relation queries the response was YES. [2023-08-30 16:53:21,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64158 conditions, 10323 events. 6538/10323 cut-off events. For 96660/97262 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 65365 event pairs, 1510 based on Foata normal form. 229/10347 useless extension candidates. Maximal degree in co-relation 64113. Up to 4889 conditions per place. [2023-08-30 16:53:21,401 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 130 selfloop transitions, 12 changer transitions 60/215 dead transitions. [2023-08-30 16:53:21,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 215 transitions, 2858 flow [2023-08-30 16:53:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-30 16:53:21,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-08-30 16:53:21,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-30 16:53:21,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-30 16:53:21,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:21,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-30 16:53:21,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:21,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:21,407 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:21,407 INFO L175 Difference]: Start difference. First operand has 89 places, 142 transitions, 1682 flow. Second operand 5 states and 608 transitions. [2023-08-30 16:53:21,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 215 transitions, 2858 flow [2023-08-30 16:53:21,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 215 transitions, 2844 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:21,568 INFO L231 Difference]: Finished difference. Result has 94 places, 118 transitions, 1390 flow [2023-08-30 16:53:21,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1390, PETRI_PLACES=94, PETRI_TRANSITIONS=118} [2023-08-30 16:53:21,569 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-08-30 16:53:21,569 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 118 transitions, 1390 flow [2023-08-30 16:53:21,569 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 16:53:21,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:21,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:21,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:53:21,570 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:21,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -308495196, now seen corresponding path program 1 times [2023-08-30 16:53:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620895575] [2023-08-30 16:53:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620895575] [2023-08-30 16:53:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620895575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388216241] [2023-08-30 16:53:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:53:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:53:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:53:21,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:21,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 118 transitions, 1390 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:21,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:21,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:21,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:22,624 INFO L130 PetriNetUnfolder]: 4027/6260 cut-off events. [2023-08-30 16:53:22,625 INFO L131 PetriNetUnfolder]: For 64770/65434 co-relation queries the response was YES. [2023-08-30 16:53:22,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38468 conditions, 6260 events. 4027/6260 cut-off events. For 64770/65434 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 37058 event pairs, 567 based on Foata normal form. 483/6571 useless extension candidates. Maximal degree in co-relation 38420. Up to 2997 conditions per place. [2023-08-30 16:53:22,657 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 159 selfloop transitions, 13 changer transitions 25/215 dead transitions. [2023-08-30 16:53:22,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 215 transitions, 2919 flow [2023-08-30 16:53:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-08-30 16:53:22,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261802575107296 [2023-08-30 16:53:22,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-08-30 16:53:22,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-08-30 16:53:22,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:22,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-08-30 16:53:22,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,663 INFO L175 Difference]: Start difference. First operand has 94 places, 118 transitions, 1390 flow. Second operand 5 states and 613 transitions. [2023-08-30 16:53:22,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 215 transitions, 2919 flow [2023-08-30 16:53:22,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 215 transitions, 2770 flow, removed 19 selfloop flow, removed 8 redundant places. [2023-08-30 16:53:22,725 INFO L231 Difference]: Finished difference. Result has 89 places, 113 transitions, 1251 flow [2023-08-30 16:53:22,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1251, PETRI_PLACES=89, PETRI_TRANSITIONS=113} [2023-08-30 16:53:22,726 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2023-08-30 16:53:22,726 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 113 transitions, 1251 flow [2023-08-30 16:53:22,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:22,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:22,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:53:22,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:22,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1848042883, now seen corresponding path program 1 times [2023-08-30 16:53:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221304624] [2023-08-30 16:53:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221304624] [2023-08-30 16:53:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221304624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707954487] [2023-08-30 16:53:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:22,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:53:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:22,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:53:22,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:53:22,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:22,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 113 transitions, 1251 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:22,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:22,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:24,089 INFO L130 PetriNetUnfolder]: 5718/9053 cut-off events. [2023-08-30 16:53:24,090 INFO L131 PetriNetUnfolder]: For 84337/84788 co-relation queries the response was YES. [2023-08-30 16:53:24,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57671 conditions, 9053 events. 5718/9053 cut-off events. For 84337/84788 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 57324 event pairs, 1019 based on Foata normal form. 195/9096 useless extension candidates. Maximal degree in co-relation 57627. Up to 4846 conditions per place. [2023-08-30 16:53:24,143 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 151 selfloop transitions, 2 changer transitions 65/232 dead transitions. [2023-08-30 16:53:24,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 232 transitions, 2983 flow [2023-08-30 16:53:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-30 16:53:24,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227467811158798 [2023-08-30 16:53:24,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-30 16:53:24,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-30 16:53:24,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:24,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-30 16:53:24,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:24,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:24,149 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:24,149 INFO L175 Difference]: Start difference. First operand has 89 places, 113 transitions, 1251 flow. Second operand 5 states and 609 transitions. [2023-08-30 16:53:24,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 232 transitions, 2983 flow [2023-08-30 16:53:24,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 232 transitions, 2893 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-30 16:53:24,360 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 1120 flow [2023-08-30 16:53:24,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1120, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2023-08-30 16:53:24,361 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2023-08-30 16:53:24,361 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 1120 flow [2023-08-30 16:53:24,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:24,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:24,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:24,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:53:24,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:24,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash 876477031, now seen corresponding path program 2 times [2023-08-30 16:53:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:24,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251648719] [2023-08-30 16:53:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:24,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251648719] [2023-08-30 16:53:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251648719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956168565] [2023-08-30 16:53:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:24,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:24,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 16:53:24,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:24,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:24,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 16:53:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:25,645 INFO L130 PetriNetUnfolder]: 5158/8017 cut-off events. [2023-08-30 16:53:25,645 INFO L131 PetriNetUnfolder]: For 82701/83273 co-relation queries the response was YES. [2023-08-30 16:53:25,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49907 conditions, 8017 events. 5158/8017 cut-off events. For 82701/83273 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 50789 event pairs, 622 based on Foata normal form. 282/8101 useless extension candidates. Maximal degree in co-relation 49866. Up to 3877 conditions per place. [2023-08-30 16:53:25,721 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 56 selfloop transitions, 17 changer transitions 109/187 dead transitions. [2023-08-30 16:53:25,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 187 transitions, 2406 flow [2023-08-30 16:53:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:53:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:53:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-08-30 16:53:25,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157367668097281 [2023-08-30 16:53:25,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-08-30 16:53:25,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-08-30 16:53:25,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:25,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-08-30 16:53:25,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,728 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,728 INFO L175 Difference]: Start difference. First operand has 93 places, 104 transitions, 1120 flow. Second operand 6 states and 721 transitions. [2023-08-30 16:53:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 187 transitions, 2406 flow [2023-08-30 16:53:26,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 187 transitions, 2296 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-08-30 16:53:26,034 INFO L231 Difference]: Finished difference. Result has 93 places, 52 transitions, 494 flow [2023-08-30 16:53:26,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=93, PETRI_TRANSITIONS=52} [2023-08-30 16:53:26,034 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2023-08-30 16:53:26,035 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 52 transitions, 494 flow [2023-08-30 16:53:26,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:26,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:26,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:26,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:53:26,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:26,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 354898285, now seen corresponding path program 1 times [2023-08-30 16:53:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126760571] [2023-08-30 16:53:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:26,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:53:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:26,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:53:26,138 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:53:26,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:53:26,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:53:26,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:53:26,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:53:26,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:53:26,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:53:26,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:53:26,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:53:26,142 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:26,147 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:53:26,148 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:53:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:53:26 BasicIcfg [2023-08-30 16:53:26,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:53:26,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:53:26,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:53:26,223 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:53:26,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51" (3/4) ... [2023-08-30 16:53:26,225 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:53:26,322 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:53:26,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:53:26,323 INFO L158 Benchmark]: Toolchain (without parser) took 35978.39ms. Allocated memory was 71.3MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 37.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-30 16:53:26,323 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:53:26,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.77ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.4MB in the end (delta: 2.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2023-08-30 16:53:26,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.85ms. Allocated memory is still 71.3MB. Free memory was 35.4MB in the beginning and 32.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:26,324 INFO L158 Benchmark]: Boogie Preprocessor took 51.45ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 30.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:26,324 INFO L158 Benchmark]: RCFGBuilder took 800.57ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 30.7MB in the beginning and 48.8MB in the end (delta: -18.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-08-30 16:53:26,324 INFO L158 Benchmark]: TraceAbstraction took 34461.52ms. Allocated memory was 88.1MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 48.2MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-30 16:53:26,325 INFO L158 Benchmark]: Witness Printer took 99.56ms. Allocated memory is still 3.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:53:26,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.77ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.4MB in the end (delta: 2.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.85ms. Allocated memory is still 71.3MB. Free memory was 35.4MB in the beginning and 32.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.45ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 30.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 800.57ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 30.7MB in the beginning and 48.8MB in the end (delta: -18.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34461.52ms. Allocated memory was 88.1MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 48.2MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 99.56ms. Allocated memory is still 3.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 32 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 8921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3359, independent: 3121, independent conditional: 0, independent unconditional: 3121, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3359, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-3, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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: 847]: 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, 164 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: 34.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1021 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2769 IncrementalHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 76 mSDtfsCounter, 2769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1682occurred in iteration=12, InterpolantAutomatonStates: 93, 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, 5.8s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:53:26,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE