./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036.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 e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:12:59,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:12:59,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:12:59,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:12:59,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:12:59,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:12:59,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:12:59,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:12:59,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:12:59,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:12:59,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:12:59,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:12:59,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:12:59,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:12:59,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:12:59,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:12:59,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:12:59,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:12:59,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:12:59,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:12:59,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:12:59,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:12:59,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:12:59,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:12:59,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:12:59,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:12:59,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:12:59,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:12:59,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:12:59,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:12:59,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:12:59,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:12:59,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:12:59,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:12:59,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:12:59,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:12:59,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:12:59,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:12:59,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:12:59,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:12:59,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:12:59,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:12:59,689 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:12:59,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:12:59,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:12:59,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:12:59,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:12:59,691 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:12:59,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:12:59,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:12:59,692 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:12:59,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:12:59,693 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:12:59,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:12:59,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:12:59,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:12:59,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:12:59,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:12:59,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:12:59,695 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:12:59,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:12:59,695 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:12:59,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:12:59,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:12:59,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:12:59,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:12:59,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:12:59,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:12:59,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:12:59,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:12:59,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:12:59,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:12:59,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:12:59,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:12:59,698 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:12:59,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:12:59,698 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:12:59,698 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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:13:00,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:13:00,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:13:00,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:13:00,034 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:13:00,035 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:13:00,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-30 23:13:01,311 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:13:01,566 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:13:01,567 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-30 23:13:01,579 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9bd89e9/6877dc2559a7418ab480945cd1720aac/FLAGc61430392 [2023-08-30 23:13:01,590 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9bd89e9/6877dc2559a7418ab480945cd1720aac [2023-08-30 23:13:01,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:13:01,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:13:01,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:01,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:13:01,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:13:01,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:01" (1/1) ... [2023-08-30 23:13:01,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7d11bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:01, skipping insertion in model container [2023-08-30 23:13:01,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:01" (1/1) ... [2023-08-30 23:13:01,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:13:01,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:13:01,828 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/mix036.oepc.i[945,958] [2023-08-30 23:13:02,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:02,070 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:13:02,081 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/mix036.oepc.i[945,958] [2023-08-30 23:13:02,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:02,202 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:02,202 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:02,208 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:13:02,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02 WrapperNode [2023-08-30 23:13:02,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:02,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:02,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:13:02,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:13:02,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,276 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-30 23:13:02,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:02,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:13:02,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:13:02,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:13:02,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:13:02,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:13:02,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:13:02,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:13:02,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (1/1) ... [2023-08-30 23:13:02,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:13:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:13:02,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:13:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:13:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:13:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:13:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:13:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:13:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:13:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:13:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:13:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:13:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:13:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:13:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:13:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:13:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:13:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:13:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:13:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:13:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:13:02,416 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:13:02,623 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:13:02,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:13:03,027 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:13:03,140 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:13:03,141 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:13:03,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:03 BoogieIcfgContainer [2023-08-30 23:13:03,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:13:03,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:13:03,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:13:03,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:13:03,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:13:01" (1/3) ... [2023-08-30 23:13:03,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f84b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:03, skipping insertion in model container [2023-08-30 23:13:03,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:02" (2/3) ... [2023-08-30 23:13:03,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f84b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:03, skipping insertion in model container [2023-08-30 23:13:03,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:03" (3/3) ... [2023-08-30 23:13:03,152 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-08-30 23:13:03,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:13:03,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:13:03,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:13:03,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:13:03,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:13:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2023-08-30 23:13:03,343 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-08-30 23:13:03,343 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:03,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:13:03,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2023-08-30 23:13:03,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-08-30 23:13:03,363 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:13:03,374 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-08-30 23:13:03,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-08-30 23:13:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-08-30 23:13:03,415 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-08-30 23:13:03,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:03,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:13:03,420 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-30 23:13:07,482 INFO L134 LiptonReduction]: Checked pairs total: 8793 [2023-08-30 23:13:07,482 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-30 23:13:07,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:13:07,500 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;@1bea4dca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:13:07,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:13:07,503 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 23:13:07,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:07,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:07,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:13:07,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:07,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 559364, now seen corresponding path program 1 times [2023-08-30 23:13:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:07,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383055567] [2023-08-30 23:13:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:07,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383055567] [2023-08-30 23:13:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383055567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:07,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:07,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122639697] [2023-08-30 23:13:07,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:07,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:07,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 247 [2023-08-30 23:13:07,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:07,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:07,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 247 [2023-08-30 23:13:07,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:09,092 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2023-08-30 23:13:09,092 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 23:13:09,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40692 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-08-30 23:13:09,143 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-30 23:13:09,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-30 23:13:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-30 23:13:09,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5452091767881242 [2023-08-30 23:13:09,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-30 23:13:09,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-30 23:13:09,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:09,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-30 23:13:09,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:09,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:09,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:09,171 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 404 transitions. [2023-08-30 23:13:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-30 23:13:09,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:09,177 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 23:13:09,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 23:13:09,181 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:13:09,182 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 23:13:09,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:09,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:09,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:09,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:13:09,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:09,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 366732100, now seen corresponding path program 1 times [2023-08-30 23:13:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091029399] [2023-08-30 23:13:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091029399] [2023-08-30 23:13:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091029399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778739880] [2023-08-30 23:13:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:09,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2023-08-30 23:13:09,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:09,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:09,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2023-08-30 23:13:09,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:10,277 INFO L130 PetriNetUnfolder]: 4279/5875 cut-off events. [2023-08-30 23:13:10,277 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2023-08-30 23:13:10,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 5875 events. 4279/5875 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27963 event pairs, 1463 based on Foata normal form. 128/5985 useless extension candidates. Maximal degree in co-relation 12289. Up to 4033 conditions per place. [2023-08-30 23:13:10,309 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-30 23:13:10,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 164 flow [2023-08-30 23:13:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 23:13:10,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236167341430499 [2023-08-30 23:13:10,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 23:13:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 23:13:10,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:10,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 23:13:10,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:10,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:10,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:10,316 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 388 transitions. [2023-08-30 23:13:10,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 164 flow [2023-08-30 23:13:10,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:10,317 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2023-08-30 23:13:10,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 23:13:10,318 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:13:10,319 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2023-08-30 23:13:10,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:10,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:10,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:10,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:13:10,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:10,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 239680015, now seen corresponding path program 1 times [2023-08-30 23:13:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198700295] [2023-08-30 23:13:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198700295] [2023-08-30 23:13:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198700295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770471740] [2023-08-30 23:13:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:10,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-08-30 23:13:10,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:10,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:10,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-08-30 23:13:10,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:11,233 INFO L130 PetriNetUnfolder]: 3810/5436 cut-off events. [2023-08-30 23:13:11,233 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2023-08-30 23:13:11,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11610 conditions, 5436 events. 3810/5436 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28377 event pairs, 701 based on Foata normal form. 384/5807 useless extension candidates. Maximal degree in co-relation 11599. Up to 3508 conditions per place. [2023-08-30 23:13:11,257 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 40 selfloop transitions, 5 changer transitions 29/77 dead transitions. [2023-08-30 23:13:11,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 333 flow [2023-08-30 23:13:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-30 23:13:11,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190283400809717 [2023-08-30 23:13:11,260 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-30 23:13:11,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-30 23:13:11,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:11,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-30 23:13:11,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:11,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:11,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:11,265 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 5 states and 641 transitions. [2023-08-30 23:13:11,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 333 flow [2023-08-30 23:13:11,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 77 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:11,269 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 113 flow [2023-08-30 23:13:11,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-30 23:13:11,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 23:13:11,270 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 113 flow [2023-08-30 23:13:11,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:11,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:11,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:11,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:13:11,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:11,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 89481488, now seen corresponding path program 1 times [2023-08-30 23:13:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30527081] [2023-08-30 23:13:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30527081] [2023-08-30 23:13:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30527081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:13:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116124978] [2023-08-30 23:13:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:11,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:13:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:13:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:13:11,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-08-30 23:13:11,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:11,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:11,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-08-30 23:13:11,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:12,101 INFO L130 PetriNetUnfolder]: 2136/3195 cut-off events. [2023-08-30 23:13:12,102 INFO L131 PetriNetUnfolder]: For 1057/1057 co-relation queries the response was YES. [2023-08-30 23:13:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8739 conditions, 3195 events. 2136/3195 cut-off events. For 1057/1057 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16210 event pairs, 428 based on Foata normal form. 249/3431 useless extension candidates. Maximal degree in co-relation 8725. Up to 1060 conditions per place. [2023-08-30 23:13:12,122 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 54 selfloop transitions, 9 changer transitions 29/95 dead transitions. [2023-08-30 23:13:12,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 487 flow [2023-08-30 23:13:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:13:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:13:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2023-08-30 23:13:12,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209176788124157 [2023-08-30 23:13:12,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2023-08-30 23:13:12,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2023-08-30 23:13:12,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:12,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2023-08-30 23:13:12,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 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 23:13:12,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:12,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:12,132 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 113 flow. Second operand 6 states and 772 transitions. [2023-08-30 23:13:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 487 flow [2023-08-30 23:13:12,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:12,144 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 178 flow [2023-08-30 23:13:12,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-30 23:13:12,145 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 23:13:12,145 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 178 flow [2023-08-30 23:13:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:12,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:12,146 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 23:13:12,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:13:12,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:12,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash 441182319, now seen corresponding path program 1 times [2023-08-30 23:13:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265947134] [2023-08-30 23:13:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:12,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265947134] [2023-08-30 23:13:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265947134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:13:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626375362] [2023-08-30 23:13:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:12,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:12,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-08-30 23:13:12,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:12,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:12,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-08-30 23:13:12,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:13,624 INFO L130 PetriNetUnfolder]: 2897/4601 cut-off events. [2023-08-30 23:13:13,624 INFO L131 PetriNetUnfolder]: For 6858/6858 co-relation queries the response was YES. [2023-08-30 23:13:13,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15230 conditions, 4601 events. 2897/4601 cut-off events. For 6858/6858 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26557 event pairs, 814 based on Foata normal form. 45/4639 useless extension candidates. Maximal degree in co-relation 15213. Up to 2110 conditions per place. [2023-08-30 23:13:13,653 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 82 selfloop transitions, 10 changer transitions 35/130 dead transitions. [2023-08-30 23:13:13,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 130 transitions, 978 flow [2023-08-30 23:13:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-30 23:13:13,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101214574898786 [2023-08-30 23:13:13,657 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-30 23:13:13,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-30 23:13:13,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:13,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-30 23:13:13,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:13,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:13,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:13,664 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 178 flow. Second operand 7 states and 882 transitions. [2023-08-30 23:13:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 130 transitions, 978 flow [2023-08-30 23:13:13,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 130 transitions, 804 flow, removed 67 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:13,740 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 205 flow [2023-08-30 23:13:13,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-30 23:13:13,743 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-08-30 23:13:13,743 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 205 flow [2023-08-30 23:13:13,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:13,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:13,744 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 23:13:13,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:13:13,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:13,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 444505301, now seen corresponding path program 2 times [2023-08-30 23:13:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896199893] [2023-08-30 23:13:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896199893] [2023-08-30 23:13:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896199893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:14,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:13:14,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072199812] [2023-08-30 23:13:14,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:14,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:14,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-08-30 23:13:14,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:14,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-08-30 23:13:14,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:14,628 INFO L130 PetriNetUnfolder]: 2183/3426 cut-off events. [2023-08-30 23:13:14,628 INFO L131 PetriNetUnfolder]: For 3537/3537 co-relation queries the response was YES. [2023-08-30 23:13:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 3426 events. 2183/3426 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18699 event pairs, 409 based on Foata normal form. 158/3569 useless extension candidates. Maximal degree in co-relation 11104. Up to 1180 conditions per place. [2023-08-30 23:13:14,648 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 86 selfloop transitions, 13 changer transitions 43/145 dead transitions. [2023-08-30 23:13:14,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 145 transitions, 927 flow [2023-08-30 23:13:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-08-30 23:13:14,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211104684788895 [2023-08-30 23:13:14,652 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-08-30 23:13:14,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-08-30 23:13:14,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:14,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-08-30 23:13:14,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,658 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,658 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 205 flow. Second operand 7 states and 901 transitions. [2023-08-30 23:13:14,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 145 transitions, 927 flow [2023-08-30 23:13:14,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 145 transitions, 922 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:14,672 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 290 flow [2023-08-30 23:13:14,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-30 23:13:14,673 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-30 23:13:14,673 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 290 flow [2023-08-30 23:13:14,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:14,674 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 23:13:14,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:13:14,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:14,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2023759729, now seen corresponding path program 1 times [2023-08-30 23:13:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018275895] [2023-08-30 23:13:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018275895] [2023-08-30 23:13:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018275895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540991743] [2023-08-30 23:13:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:14,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 247 [2023-08-30 23:13:14,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:14,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:14,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 247 [2023-08-30 23:13:14,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:15,749 INFO L130 PetriNetUnfolder]: 4941/7397 cut-off events. [2023-08-30 23:13:15,749 INFO L131 PetriNetUnfolder]: For 11038/11038 co-relation queries the response was YES. [2023-08-30 23:13:15,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24751 conditions, 7397 events. 4941/7397 cut-off events. For 11038/11038 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40131 event pairs, 580 based on Foata normal form. 16/7413 useless extension candidates. Maximal degree in co-relation 24738. Up to 4273 conditions per place. [2023-08-30 23:13:15,821 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 116 selfloop transitions, 11 changer transitions 4/131 dead transitions. [2023-08-30 23:13:15,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 1023 flow [2023-08-30 23:13:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-30 23:13:15,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2023-08-30 23:13:15,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-30 23:13:15,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-30 23:13:15,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:15,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-30 23:13:15,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:15,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:15,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:15,828 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 290 flow. Second operand 5 states and 624 transitions. [2023-08-30 23:13:15,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 1023 flow [2023-08-30 23:13:15,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 131 transitions, 863 flow, removed 57 selfloop flow, removed 5 redundant places. [2023-08-30 23:13:15,953 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 307 flow [2023-08-30 23:13:15,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-30 23:13:15,954 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-08-30 23:13:15,954 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 307 flow [2023-08-30 23:13:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:15,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:15,954 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 23:13:15,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:13:15,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:15,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1872605621, now seen corresponding path program 2 times [2023-08-30 23:13:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535314381] [2023-08-30 23:13:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535314381] [2023-08-30 23:13:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535314381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:16,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:16,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:13:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433660939] [2023-08-30 23:13:16,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:16,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:13:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:13:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:13:16,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 247 [2023-08-30 23:13:16,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:16,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:16,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 247 [2023-08-30 23:13:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:16,959 INFO L130 PetriNetUnfolder]: 3519/5506 cut-off events. [2023-08-30 23:13:16,959 INFO L131 PetriNetUnfolder]: For 7526/7613 co-relation queries the response was YES. [2023-08-30 23:13:16,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19155 conditions, 5506 events. 3519/5506 cut-off events. For 7526/7613 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32996 event pairs, 656 based on Foata normal form. 64/5408 useless extension candidates. Maximal degree in co-relation 19141. Up to 2280 conditions per place. [2023-08-30 23:13:17,003 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 92 selfloop transitions, 18 changer transitions 18/136 dead transitions. [2023-08-30 23:13:17,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 136 transitions, 948 flow [2023-08-30 23:13:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:13:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:13:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 23:13:17,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060728744939271 [2023-08-30 23:13:17,007 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 23:13:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 23:13:17,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:17,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 23:13:17,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:17,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:17,013 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:17,013 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 307 flow. Second operand 8 states and 1000 transitions. [2023-08-30 23:13:17,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 136 transitions, 948 flow [2023-08-30 23:13:17,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 918 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:17,172 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 350 flow [2023-08-30 23:13:17,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-08-30 23:13:17,173 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-30 23:13:17,173 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 350 flow [2023-08-30 23:13:17,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:17,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:17,174 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 23:13:17,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:13:17,174 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:17,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash 901848849, now seen corresponding path program 1 times [2023-08-30 23:13:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:17,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056859357] [2023-08-30 23:13:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056859357] [2023-08-30 23:13:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056859357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:13:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810066873] [2023-08-30 23:13:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:17,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:13:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:13:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:13:17,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 247 [2023-08-30 23:13:17,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:17,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:17,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 247 [2023-08-30 23:13:17,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:19,117 INFO L130 PetriNetUnfolder]: 7280/10966 cut-off events. [2023-08-30 23:13:19,117 INFO L131 PetriNetUnfolder]: For 22187/22187 co-relation queries the response was YES. [2023-08-30 23:13:19,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42011 conditions, 10966 events. 7280/10966 cut-off events. For 22187/22187 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 63840 event pairs, 1062 based on Foata normal form. 1/10967 useless extension candidates. Maximal degree in co-relation 41994. Up to 5389 conditions per place. [2023-08-30 23:13:19,195 INFO L137 encePairwiseOnDemand]: 235/247 looper letters, 124 selfloop transitions, 29 changer transitions 97/250 dead transitions. [2023-08-30 23:13:19,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 250 transitions, 1860 flow [2023-08-30 23:13:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 23:13:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 23:13:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1628 transitions. [2023-08-30 23:13:19,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707923655292076 [2023-08-30 23:13:19,201 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1628 transitions. [2023-08-30 23:13:19,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1628 transitions. [2023-08-30 23:13:19,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:19,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1628 transitions. [2023-08-30 23:13:19,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 116.28571428571429) internal successors, (1628), 14 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:19,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 247.0) internal successors, (3705), 15 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:19,211 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 247.0) internal successors, (3705), 15 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:19,211 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 350 flow. Second operand 14 states and 1628 transitions. [2023-08-30 23:13:19,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 250 transitions, 1860 flow [2023-08-30 23:13:19,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 250 transitions, 1713 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-08-30 23:13:19,458 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 603 flow [2023-08-30 23:13:19,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=603, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2023-08-30 23:13:19,459 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-08-30 23:13:19,459 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 603 flow [2023-08-30 23:13:19,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:19,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:19,460 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 23:13:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:13:19,460 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:19,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1205370947, now seen corresponding path program 2 times [2023-08-30 23:13:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062661424] [2023-08-30 23:13:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062661424] [2023-08-30 23:13:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062661424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:19,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:19,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673561247] [2023-08-30 23:13:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:19,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:19,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:19,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 247 [2023-08-30 23:13:19,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:19,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:19,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 247 [2023-08-30 23:13:19,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:20,746 INFO L130 PetriNetUnfolder]: 4843/7406 cut-off events. [2023-08-30 23:13:20,746 INFO L131 PetriNetUnfolder]: For 23263/23263 co-relation queries the response was YES. [2023-08-30 23:13:20,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30747 conditions, 7406 events. 4843/7406 cut-off events. For 23263/23263 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 41353 event pairs, 665 based on Foata normal form. 1/7407 useless extension candidates. Maximal degree in co-relation 30720. Up to 4096 conditions per place. [2023-08-30 23:13:20,809 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 134 selfloop transitions, 21 changer transitions 18/173 dead transitions. [2023-08-30 23:13:20,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 173 transitions, 1598 flow [2023-08-30 23:13:20,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-30 23:13:20,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-08-30 23:13:20,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-30 23:13:20,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-30 23:13:20,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:20,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-30 23:13:20,814 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 23:13:20,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:20,816 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:20,816 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 603 flow. Second operand 5 states and 608 transitions. [2023-08-30 23:13:20,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 173 transitions, 1598 flow [2023-08-30 23:13:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 173 transitions, 1498 flow, removed 50 selfloop flow, removed 6 redundant places. [2023-08-30 23:13:21,013 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 679 flow [2023-08-30 23:13:21,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-08-30 23:13:21,015 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-08-30 23:13:21,015 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 679 flow [2023-08-30 23:13:21,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:21,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:21,015 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 23:13:21,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:13:21,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:21,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1759640595, now seen corresponding path program 3 times [2023-08-30 23:13:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51041741] [2023-08-30 23:13:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51041741] [2023-08-30 23:13:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51041741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:22,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 23:13:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882016773] [2023-08-30 23:13:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 23:13:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 23:13:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 23:13:22,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 247 [2023-08-30 23:13:22,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 679 flow. Second operand has 10 states, 10 states have (on average 106.8) internal successors, (1068), 10 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:22,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:22,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 247 [2023-08-30 23:13:22,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:24,065 INFO L130 PetriNetUnfolder]: 5382/8366 cut-off events. [2023-08-30 23:13:24,065 INFO L131 PetriNetUnfolder]: For 25007/25007 co-relation queries the response was YES. [2023-08-30 23:13:24,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34921 conditions, 8366 events. 5382/8366 cut-off events. For 25007/25007 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 49377 event pairs, 1387 based on Foata normal form. 1/8367 useless extension candidates. Maximal degree in co-relation 34897. Up to 3537 conditions per place. [2023-08-30 23:13:24,117 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 144 selfloop transitions, 24 changer transitions 55/223 dead transitions. [2023-08-30 23:13:24,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 223 transitions, 1952 flow [2023-08-30 23:13:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:13:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:13:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 951 transitions. [2023-08-30 23:13:24,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812753036437247 [2023-08-30 23:13:24,121 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 951 transitions. [2023-08-30 23:13:24,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 951 transitions. [2023-08-30 23:13:24,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:24,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 951 transitions. [2023-08-30 23:13:24,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:24,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:24,127 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:24,127 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 679 flow. Second operand 8 states and 951 transitions. [2023-08-30 23:13:24,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 223 transitions, 1952 flow [2023-08-30 23:13:24,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 223 transitions, 1952 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:13:24,352 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 754 flow [2023-08-30 23:13:24,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=754, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2023-08-30 23:13:24,353 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2023-08-30 23:13:24,353 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 754 flow [2023-08-30 23:13:24,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.8) internal successors, (1068), 10 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:24,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:24,354 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 23:13:24,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:13:24,354 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:13:24,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1981551935, now seen corresponding path program 4 times [2023-08-30 23:13:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839419029] [2023-08-30 23:13:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:24,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:13:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:24,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:13:24,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:13:24,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:13:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:13:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:13:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:13:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:13:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:13:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:13:24,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:13:24,479 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2023-08-30 23:13:24,485 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:13:24,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:13:24,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:13:24 BasicIcfg [2023-08-30 23:13:24,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:13:24,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:13:24,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:13:24,580 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:13:24,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:03" (3/4) ... [2023-08-30 23:13:24,582 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:13:24,687 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:13:24,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:13:24,688 INFO L158 Benchmark]: Toolchain (without parser) took 23094.47ms. Allocated memory was 60.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 36.3MB in the beginning and 877.7MB in the end (delta: -841.4MB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,688 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:13:24,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.56ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.2MB in the beginning and 50.5MB in the end (delta: -14.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.28ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 47.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,689 INFO L158 Benchmark]: Boogie Preprocessor took 51.05ms. Allocated memory is still 73.4MB. Free memory was 47.9MB in the beginning and 45.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,689 INFO L158 Benchmark]: RCFGBuilder took 809.88ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 40.5MB in the end (delta: 5.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,689 INFO L158 Benchmark]: TraceAbstraction took 21433.06ms. Allocated memory was 73.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.8MB in the beginning and 894.5MB in the end (delta: -854.7MB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,689 INFO L158 Benchmark]: Witness Printer took 107.49ms. Allocated memory is still 1.4GB. Free memory was 894.5MB in the beginning and 877.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:13:24,693 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 50.3MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.56ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.2MB in the beginning and 50.5MB in the end (delta: -14.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.28ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 47.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.05ms. Allocated memory is still 73.4MB. Free memory was 47.9MB in the beginning and 45.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 809.88ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 40.5MB in the end (delta: 5.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21433.06ms. Allocated memory was 73.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.8MB in the beginning and 894.5MB in the end (delta: -854.7MB). Peak memory consumption was 438.5MB. Max. memory is 16.1GB. * Witness Printer took 107.49ms. Allocated memory is still 1.4GB. Free memory was 894.5MB in the beginning and 877.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 43 PlacesAfterwards, 130 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8793 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3916, independent: 3698, independent conditional: 0, independent unconditional: 3698, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1756, independent: 1708, independent conditional: 0, independent unconditional: 1708, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3916, independent: 1990, independent conditional: 0, independent unconditional: 1990, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1756, unknown conditional: 0, unknown unconditional: 1756] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-1, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=2, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2056 IncrementalHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 34 mSDtfsCounter, 2056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=754occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:13:24,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE