./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:59:10,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:59:10,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:59:10,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:59:10,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:59:10,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:59:10,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:59:10,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:59:10,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:59:10,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:59:10,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:59:10,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:59:10,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:59:10,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:59:10,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:59:10,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:59:10,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:59:10,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:59:10,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:59:10,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:59:10,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:59:10,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:59:10,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:59:10,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:59:10,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:59:10,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:59:10,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:59:10,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:59:10,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:59:10,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:59:10,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:59:10,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:59:10,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:59:10,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:59:10,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:59:10,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:59:10,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:59:10,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:59:10,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:59:10,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:59:10,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:59:10,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:59:10,780 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:59:10,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:59:10,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:59:10,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:59:10,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:59:10,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:59:10,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:59:10,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:59:10,783 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:59:10,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:59:10,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:59:10,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:59:10,785 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:59:10,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:59:10,785 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:59:10,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:59:10,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:59:10,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:59:10,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:59:10,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:10,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:59:10,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:59:10,787 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:59:10,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:59:10,788 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:59:10,788 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 -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:59:11,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:59:11,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:59:11,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:59:11,096 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:59:11,096 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:59:11,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:59:12,054 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:59:12,285 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:59:12,285 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:59:12,294 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6811203/88c749c2b1d64ff9807e3d7af3c46fc3/FLAG8d91f1cc1 [2023-09-01 09:59:12,628 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6811203/88c749c2b1d64ff9807e3d7af3c46fc3 [2023-09-01 09:59:12,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:59:12,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:59:12,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:12,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:59:12,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:59:12,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:12" (1/1) ... [2023-09-01 09:59:12,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e3717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:12, skipping insertion in model container [2023-09-01 09:59:12,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:12" (1/1) ... [2023-09-01 09:59:12,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:59:12,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:59:12,821 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-09-01 09:59:12,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:13,008 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:59:13,017 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-09-01 09:59:13,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:13,089 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:13,089 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:13,094 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:59:13,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13 WrapperNode [2023-09-01 09:59:13,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:13,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:13,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:59:13,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:59:13,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,126 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-09-01 09:59:13,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:13,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:59:13,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:59:13,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:59:13,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:59:13,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:59:13,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:59:13,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:59:13,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (1/1) ... [2023-09-01 09:59:13,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:13,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:59:13,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:59:13,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:59:13,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:59:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:59:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:59:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:59:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:59:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:59:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:59:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:59:13,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:59:13,224 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:59:13,394 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:59:13,396 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:59:13,600 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:59:13,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:59:13,725 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:59:13,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:13 BoogieIcfgContainer [2023-09-01 09:59:13,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:59:13,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:59:13,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:59:13,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:59:13,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:59:12" (1/3) ... [2023-09-01 09:59:13,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:13, skipping insertion in model container [2023-09-01 09:59:13,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:13" (2/3) ... [2023-09-01 09:59:13,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:13, skipping insertion in model container [2023-09-01 09:59:13,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:13" (3/3) ... [2023-09-01 09:59:13,737 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:59:13,744 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:59:13,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:59:13,752 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:59:13,753 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:59:13,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:59:13,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-09-01 09:59:13,912 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-09-01 09:59:13,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:13,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-09-01 09:59:13,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-09-01 09:59:13,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-09-01 09:59:13,931 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:59:13,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-09-01 09:59:13,945 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-09-01 09:59:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-09-01 09:59:13,982 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-09-01 09:59:13,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-09-01 09:59:13,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 1676 [2023-09-01 09:59:16,618 INFO L134 LiptonReduction]: Checked pairs total: 4017 [2023-09-01 09:59:16,619 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-09-01 09:59:16,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:59:16,661 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;@25745867, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:59:16,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:59:16,670 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-09-01 09:59:16,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:16,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:16,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:16,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:16,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:16,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2110564132, now seen corresponding path program 1 times [2023-09-01 09:59:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152736751] [2023-09-01 09:59:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:16,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152736751] [2023-09-01 09:59:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152736751] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:16,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:59:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863166729] [2023-09-01 09:59:17,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:17,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-09-01 09:59:17,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:17,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-09-01 09:59:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:17,168 INFO L130 PetriNetUnfolder]: 511/844 cut-off events. [2023-09-01 09:59:17,168 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-09-01 09:59:17,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 844 events. 511/844 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3914 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1652. Up to 580 conditions per place. [2023-09-01 09:59:17,174 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-09-01 09:59:17,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2023-09-01 09:59:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:59:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:59:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-09-01 09:59:17,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-09-01 09:59:17,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-09-01 09:59:17,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-09-01 09:59:17,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:17,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-09-01 09:59:17,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,195 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 3 states and 312 transitions. [2023-09-01 09:59:17,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2023-09-01 09:59:17,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:59:17,199 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-09-01 09:59:17,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-09-01 09:59:17,202 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-09-01 09:59:17,202 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-09-01 09:59:17,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:17,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:17,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:59:17,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:17,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1027505935, now seen corresponding path program 1 times [2023-09-01 09:59:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587360180] [2023-09-01 09:59:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587360180] [2023-09-01 09:59:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587360180] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:17,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:17,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:59:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957035928] [2023-09-01 09:59:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:17,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:17,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-09-01 09:59:17,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:17,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-09-01 09:59:17,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:17,491 INFO L130 PetriNetUnfolder]: 489/786 cut-off events. [2023-09-01 09:59:17,491 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-09-01 09:59:17,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 786 events. 489/786 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3321 event pairs, 117 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1608. Up to 689 conditions per place. [2023-09-01 09:59:17,495 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-09-01 09:59:17,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2023-09-01 09:59:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:59:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:59:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-09-01 09:59:17,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116666666666667 [2023-09-01 09:59:17,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-09-01 09:59:17,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-09-01 09:59:17,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:17,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-09-01 09:59:17,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,501 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 307 transitions. [2023-09-01 09:59:17,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2023-09-01 09:59:17,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:59:17,502 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-09-01 09:59:17,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-09-01 09:59:17,503 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-09-01 09:59:17,503 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-09-01 09:59:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:17,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:17,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:59:17,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:17,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1787914235, now seen corresponding path program 1 times [2023-09-01 09:59:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381009916] [2023-09-01 09:59:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381009916] [2023-09-01 09:59:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381009916] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297939221] [2023-09-01 09:59:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:17,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:17,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-09-01 09:59:17,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:17,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-09-01 09:59:17,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:17,776 INFO L130 PetriNetUnfolder]: 351/600 cut-off events. [2023-09-01 09:59:17,777 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-09-01 09:59:17,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 600 events. 351/600 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2631 event pairs, 70 based on Foata normal form. 56/650 useless extension candidates. Maximal degree in co-relation 1359. Up to 368 conditions per place. [2023-09-01 09:59:17,779 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 27 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-09-01 09:59:17,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 246 flow [2023-09-01 09:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-09-01 09:59:17,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483 [2023-09-01 09:59:17,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-09-01 09:59:17,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-09-01 09:59:17,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:17,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-09-01 09:59:17,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,785 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,785 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 5 states and 483 transitions. [2023-09-01 09:59:17,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 246 flow [2023-09-01 09:59:17,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:59:17,787 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2023-09-01 09:59:17,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-09-01 09:59:17,787 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-09-01 09:59:17,788 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2023-09-01 09:59:17,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:17,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:17,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:59:17,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:17,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1225705439, now seen corresponding path program 1 times [2023-09-01 09:59:17,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:17,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020083368] [2023-09-01 09:59:17,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020083368] [2023-09-01 09:59:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020083368] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:59:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6910046] [2023-09-01 09:59:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:17,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-09-01 09:59:17,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:17,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:17,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-09-01 09:59:17,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:18,038 INFO L130 PetriNetUnfolder]: 172/324 cut-off events. [2023-09-01 09:59:18,039 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2023-09-01 09:59:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 324 events. 172/324 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1227 event pairs, 33 based on Foata normal form. 32/354 useless extension candidates. Maximal degree in co-relation 947. Up to 119 conditions per place. [2023-09-01 09:59:18,041 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 34 selfloop transitions, 7 changer transitions 18/62 dead transitions. [2023-09-01 09:59:18,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 346 flow [2023-09-01 09:59:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2023-09-01 09:59:18,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-09-01 09:59:18,043 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2023-09-01 09:59:18,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2023-09-01 09:59:18,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:18,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2023-09-01 09:59:18,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,047 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,047 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 6 states and 580 transitions. [2023-09-01 09:59:18,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 346 flow [2023-09-01 09:59:18,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 340 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:59:18,049 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 146 flow [2023-09-01 09:59:18,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-09-01 09:59:18,050 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-09-01 09:59:18,050 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 146 flow [2023-09-01 09:59:18,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:18,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:18,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:59:18,051 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:18,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1049778953, now seen corresponding path program 1 times [2023-09-01 09:59:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224984452] [2023-09-01 09:59:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224984452] [2023-09-01 09:59:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224984452] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:18,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959909262] [2023-09-01 09:59:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:18,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:18,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-09-01 09:59:18,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:18,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-09-01 09:59:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:18,375 INFO L130 PetriNetUnfolder]: 282/528 cut-off events. [2023-09-01 09:59:18,376 INFO L131 PetriNetUnfolder]: For 730/730 co-relation queries the response was YES. [2023-09-01 09:59:18,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 528 events. 282/528 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2242 event pairs, 3 based on Foata normal form. 11/539 useless extension candidates. Maximal degree in co-relation 1733. Up to 255 conditions per place. [2023-09-01 09:59:18,379 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 63 selfloop transitions, 13 changer transitions 2/78 dead transitions. [2023-09-01 09:59:18,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 78 transitions, 568 flow [2023-09-01 09:59:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2023-09-01 09:59:18,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494 [2023-09-01 09:59:18,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2023-09-01 09:59:18,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2023-09-01 09:59:18,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:18,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2023-09-01 09:59:18,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,385 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 146 flow. Second operand 5 states and 494 transitions. [2023-09-01 09:59:18,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 78 transitions, 568 flow [2023-09-01 09:59:18,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 78 transitions, 478 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:18,392 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 210 flow [2023-09-01 09:59:18,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2023-09-01 09:59:18,394 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-09-01 09:59:18,395 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 210 flow [2023-09-01 09:59:18,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:18,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:18,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:59:18,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:18,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash -303048525, now seen corresponding path program 2 times [2023-09-01 09:59:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475265876] [2023-09-01 09:59:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475265876] [2023-09-01 09:59:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475265876] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:59:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308082407] [2023-09-01 09:59:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:18,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:59:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:59:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:59:18,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-09-01 09:59:18,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:18,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-09-01 09:59:18,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:18,839 INFO L130 PetriNetUnfolder]: 197/390 cut-off events. [2023-09-01 09:59:18,840 INFO L131 PetriNetUnfolder]: For 543/548 co-relation queries the response was YES. [2023-09-01 09:59:18,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 390 events. 197/390 cut-off events. For 543/548 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1709 event pairs, 35 based on Foata normal form. 25/403 useless extension candidates. Maximal degree in co-relation 1333. Up to 146 conditions per place. [2023-09-01 09:59:18,842 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 35 selfloop transitions, 10 changer transitions 20/72 dead transitions. [2023-09-01 09:59:18,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 510 flow [2023-09-01 09:59:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:59:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:59:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2023-09-01 09:59:18,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707142857142857 [2023-09-01 09:59:18,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2023-09-01 09:59:18,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2023-09-01 09:59:18,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:18,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2023-09-01 09:59:18,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,847 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,848 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 210 flow. Second operand 7 states and 659 transitions. [2023-09-01 09:59:18,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 510 flow [2023-09-01 09:59:18,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 492 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-09-01 09:59:18,850 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 216 flow [2023-09-01 09:59:18,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-09-01 09:59:18,851 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-09-01 09:59:18,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 216 flow [2023-09-01 09:59:18,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:18,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:18,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:18,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:59:18,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:18,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1045390772, now seen corresponding path program 1 times [2023-09-01 09:59:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116743925] [2023-09-01 09:59:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116743925] [2023-09-01 09:59:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116743925] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:59:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298944145] [2023-09-01 09:59:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:19,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:59:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:59:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:59:19,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-09-01 09:59:19,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:19,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:19,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-09-01 09:59:19,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:20,016 INFO L130 PetriNetUnfolder]: 271/544 cut-off events. [2023-09-01 09:59:20,016 INFO L131 PetriNetUnfolder]: For 1093/1096 co-relation queries the response was YES. [2023-09-01 09:59:20,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 544 events. 271/544 cut-off events. For 1093/1096 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2573 event pairs, 45 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 2032. Up to 271 conditions per place. [2023-09-01 09:59:20,019 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 53 selfloop transitions, 6 changer transitions 27/90 dead transitions. [2023-09-01 09:59:20,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 739 flow [2023-09-01 09:59:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:59:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:59:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-09-01 09:59:20,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-09-01 09:59:20,021 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-09-01 09:59:20,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-09-01 09:59:20,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:20,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-09-01 09:59:20,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,024 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,025 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 216 flow. Second operand 7 states and 680 transitions. [2023-09-01 09:59:20,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 739 flow [2023-09-01 09:59:20,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 657 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-09-01 09:59:20,029 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 232 flow [2023-09-01 09:59:20,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-09-01 09:59:20,030 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-09-01 09:59:20,030 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 232 flow [2023-09-01 09:59:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:20,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:20,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:59:20,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:20,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash -4512334, now seen corresponding path program 2 times [2023-09-01 09:59:20,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:20,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997157237] [2023-09-01 09:59:20,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:20,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997157237] [2023-09-01 09:59:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997157237] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:20,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:20,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541848802] [2023-09-01 09:59:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:20,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:20,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-09-01 09:59:20,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:20,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-09-01 09:59:20,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:20,307 INFO L130 PetriNetUnfolder]: 205/432 cut-off events. [2023-09-01 09:59:20,308 INFO L131 PetriNetUnfolder]: For 940/945 co-relation queries the response was YES. [2023-09-01 09:59:20,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 432 events. 205/432 cut-off events. For 940/945 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2102 event pairs, 56 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1776. Up to 210 conditions per place. [2023-09-01 09:59:20,310 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 32 selfloop transitions, 3 changer transitions 20/57 dead transitions. [2023-09-01 09:59:20,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 456 flow [2023-09-01 09:59:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:59:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:59:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-09-01 09:59:20,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-09-01 09:59:20,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-09-01 09:59:20,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-09-01 09:59:20,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:20,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-09-01 09:59:20,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,313 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 232 flow. Second operand 3 states and 304 transitions. [2023-09-01 09:59:20,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 456 flow [2023-09-01 09:59:20,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 447 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 09:59:20,317 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 197 flow [2023-09-01 09:59:20,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-09-01 09:59:20,319 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-09-01 09:59:20,319 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 197 flow [2023-09-01 09:59:20,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:20,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:20,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:59:20,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:20,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1706584140, now seen corresponding path program 3 times [2023-09-01 09:59:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876242849] [2023-09-01 09:59:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876242849] [2023-09-01 09:59:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876242849] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:59:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183001679] [2023-09-01 09:59:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:20,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:59:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:59:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:59:20,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-09-01 09:59:20,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:20,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-09-01 09:59:20,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:20,895 INFO L130 PetriNetUnfolder]: 75/188 cut-off events. [2023-09-01 09:59:20,896 INFO L131 PetriNetUnfolder]: For 400/406 co-relation queries the response was YES. [2023-09-01 09:59:20,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 188 events. 75/188 cut-off events. For 400/406 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 780 event pairs, 7 based on Foata normal form. 4/190 useless extension candidates. Maximal degree in co-relation 737. Up to 84 conditions per place. [2023-09-01 09:59:20,896 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 26 selfloop transitions, 5 changer transitions 18/52 dead transitions. [2023-09-01 09:59:20,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 420 flow [2023-09-01 09:59:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:59:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:59:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2023-09-01 09:59:20,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707142857142857 [2023-09-01 09:59:20,898 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2023-09-01 09:59:20,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2023-09-01 09:59:20,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:20,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2023-09-01 09:59:20,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,902 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,902 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 197 flow. Second operand 7 states and 659 transitions. [2023-09-01 09:59:20,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 420 flow [2023-09-01 09:59:20,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 383 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-09-01 09:59:20,904 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 175 flow [2023-09-01 09:59:20,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-09-01 09:59:20,904 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-09-01 09:59:20,905 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 175 flow [2023-09-01 09:59:20,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:20,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:20,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:20,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:59:20,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:20,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -780194826, now seen corresponding path program 4 times [2023-09-01 09:59:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:20,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395947128] [2023-09-01 09:59:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395947128] [2023-09-01 09:59:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395947128] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:59:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349264989] [2023-09-01 09:59:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:21,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:21,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-09-01 09:59:21,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:21,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:21,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-09-01 09:59:21,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:21,140 INFO L130 PetriNetUnfolder]: 60/161 cut-off events. [2023-09-01 09:59:21,140 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2023-09-01 09:59:21,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 161 events. 60/161 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 590 event pairs, 8 based on Foata normal form. 1/162 useless extension candidates. Maximal degree in co-relation 651. Up to 63 conditions per place. [2023-09-01 09:59:21,141 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 23 selfloop transitions, 3 changer transitions 30/56 dead transitions. [2023-09-01 09:59:21,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 440 flow [2023-09-01 09:59:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-09-01 09:59:21,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-09-01 09:59:21,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-09-01 09:59:21,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-09-01 09:59:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:21,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-09-01 09:59:21,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:21,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:21,146 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:21,146 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 175 flow. Second operand 6 states and 564 transitions. [2023-09-01 09:59:21,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 440 flow [2023-09-01 09:59:21,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 414 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-09-01 09:59:21,148 INFO L231 Difference]: Finished difference. Result has 50 places, 25 transitions, 133 flow [2023-09-01 09:59:21,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=50, PETRI_TRANSITIONS=25} [2023-09-01 09:59:21,148 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2023-09-01 09:59:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 25 transitions, 133 flow [2023-09-01 09:59:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:59:21,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:21,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:21,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:59:21,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:59:21,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -142409316, now seen corresponding path program 5 times [2023-09-01 09:59:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174800191] [2023-09-01 09:59:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:59:21,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:59:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:59:21,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:59:21,228 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:59:21,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:59:21,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:59:21,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:59:21,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:59:21,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:59:21,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:59:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:59:21,231 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2023-09-01 09:59:21,235 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:59:21,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:59:21,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:59:21 BasicIcfg [2023-09-01 09:59:21,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:59:21,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:59:21,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:59:21,294 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:59:21,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:13" (3/4) ... [2023-09-01 09:59:21,302 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:59:21,389 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:59:21,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:59:21,391 INFO L158 Benchmark]: Toolchain (without parser) took 8759.58ms. Allocated memory was 90.2MB in the beginning and 287.3MB in the end (delta: 197.1MB). Free memory was 66.6MB in the beginning and 145.1MB in the end (delta: -78.5MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,391 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:59:21,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.21ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 65.7MB in the end (delta: 862.3kB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,392 INFO L158 Benchmark]: Boogie Preprocessor took 19.70ms. Allocated memory is still 90.2MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,392 INFO L158 Benchmark]: RCFGBuilder took 579.67ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 66.9MB in the end (delta: -5.4MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,393 INFO L158 Benchmark]: TraceAbstraction took 7565.15ms. Allocated memory was 90.2MB in the beginning and 287.3MB in the end (delta: 197.1MB). Free memory was 66.4MB in the beginning and 154.6MB in the end (delta: -88.1MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,393 INFO L158 Benchmark]: Witness Printer took 96.51ms. Allocated memory is still 287.3MB. Free memory was 154.6MB in the beginning and 145.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 09:59:21,394 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.13ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.21ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 65.7MB in the end (delta: 862.3kB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.70ms. Allocated memory is still 90.2MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.67ms. Allocated memory is still 90.2MB. Free memory was 61.5MB in the beginning and 66.9MB in the end (delta: -5.4MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7565.15ms. Allocated memory was 90.2MB in the beginning and 287.3MB in the end (delta: 197.1MB). Free memory was 66.4MB in the beginning and 154.6MB in the end (delta: -88.1MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Witness Printer took 96.51ms. Allocated memory is still 287.3MB. Free memory was 154.6MB in the beginning and 145.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 111 PlacesBefore, 31 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 4017 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1866, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 920, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1866, independent: 841, independent conditional: 0, independent unconditional: 841, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 920, unknown conditional: 0, unknown unconditional: 920] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-3, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-2, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 832]: 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: 828]: 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 7 procedures, 131 locations, 6 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: 7.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 979 IncrementalHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 60 mSDtfsCounter, 979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=7, InterpolantAutomatonStates: 52, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:59:21,411 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