./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 --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:49:20,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:49:20,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:49:20,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:49:20,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:49:20,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:49:20,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:49:20,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:49:20,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:49:20,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:49:20,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:49:20,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:49:20,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:49:20,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:49:20,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:49:20,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:49:20,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:49:20,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:49:20,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:49:20,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:49:20,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:49:20,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:49:20,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:49:20,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:49:20,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:49:20,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:49:20,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:49:20,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:49:20,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:49:20,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:49:20,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:49:20,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:49:20,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:49:20,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:49:20,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:49:20,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:49:20,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:49:20,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:49:20,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:49:20,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:49:20,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:49:20,254 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:49:20,276 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:49:20,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:49:20,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:49:20,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:49:20,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:49:20,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:49:20,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:49:20,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:49:20,281 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:49:20,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:49:20,282 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:49:20,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:49:20,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:49:20,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:49:20,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:49:20,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:49:20,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:49:20,283 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:49:20,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:49:20,284 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:49:20,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:49:20,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:49:20,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:49:20,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:49:20,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:49:20,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:49:20,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:49:20,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:49:20,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:49:20,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:49:20,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:49:20,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:49:20,287 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:49:20,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:49:20,287 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:49:20,288 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 -> 7ebc335b60b8cdd623e40ee7c2c99e8e082656d42f1fdf6911dd5259073d8a45 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:49:20,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:49:20,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:49:20,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:49:20,614 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:49:20,614 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:49:20,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:49:21,912 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:49:22,146 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:49:22,146 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:49:22,160 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fc62b4a/2b2450dcebaa4a3f97b4b1e2fb180b21/FLAG02343295c [2023-09-01 09:49:22,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80fc62b4a/2b2450dcebaa4a3f97b4b1e2fb180b21 [2023-09-01 09:49:22,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:49:22,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:49:22,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:49:22,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:49:22,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:49:22,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39faabbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22, skipping insertion in model container [2023-09-01 09:49:22,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:49:22,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:49:22,421 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/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:49:22,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:49:22,664 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:49:22,675 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/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:49:22,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:49:22,787 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:49:22,788 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:49:22,794 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:49:22,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22 WrapperNode [2023-09-01 09:49:22,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:49:22,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:49:22,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:49:22,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:49:22,802 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:49:22" (1/1) ... [2023-09-01 09:49:22,832 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:49:22" (1/1) ... [2023-09-01 09:49:22,872 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2023-09-01 09:49:22,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:49:22,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:49:22,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:49:22,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:49:22,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:49:22,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:49:22,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:49:22,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:49:22,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (1/1) ... [2023-09-01 09:49:22,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:49:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:49:22,933 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:49:22,936 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:49:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:49:22,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:49:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:49:22,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:49:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:49:22,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:49:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:49:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:49:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:49:22,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:49:22,961 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:49:23,083 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:49:23,085 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:49:23,452 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:49:23,586 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:49:23,587 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:49:23,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:49:23 BoogieIcfgContainer [2023-09-01 09:49:23,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:49:23,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:49:23,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:49:23,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:49:23,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:49:22" (1/3) ... [2023-09-01 09:49:23,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630c3d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:49:23, skipping insertion in model container [2023-09-01 09:49:23,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:49:22" (2/3) ... [2023-09-01 09:49:23,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630c3d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:49:23, skipping insertion in model container [2023-09-01 09:49:23,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:49:23" (3/3) ... [2023-09-01 09:49:23,598 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:49:23,605 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:49:23,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:49:23,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:49:23,611 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:49:23,652 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:49:23,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-09-01 09:49:23,746 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-09-01 09:49:23,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:49:23,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-09-01 09:49:23,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-09-01 09:49:23,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-09-01 09:49:23,766 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:49:23,782 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-09-01 09:49:23,785 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-09-01 09:49:23,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-09-01 09:49:23,827 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-09-01 09:49:23,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:49:23,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-09-01 09:49:23,829 INFO L119 LiptonReduction]: Number of co-enabled transitions 2308 [2023-09-01 09:49:27,420 INFO L134 LiptonReduction]: Checked pairs total: 6373 [2023-09-01 09:49:27,420 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-09-01 09:49:27,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:49:27,438 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;@7703435d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:49:27,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:49:27,441 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:49:27,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:49:27,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:27,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:49:27,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:27,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 495318, now seen corresponding path program 1 times [2023-09-01 09:49:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634067597] [2023-09-01 09:49:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:27,880 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:49:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634067597] [2023-09-01 09:49:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634067597] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:49:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501492839] [2023-09-01 09:49:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:27,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:49:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:49:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:49:27,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 215 [2023-09-01 09:49:27,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:49:27,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:27,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 215 [2023-09-01 09:49:27,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:28,285 INFO L130 PetriNetUnfolder]: 1144/1841 cut-off events. [2023-09-01 09:49:28,286 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-09-01 09:49:28,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1841 events. 1144/1841 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9900 event pairs, 184 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 3578. Up to 1372 conditions per place. [2023-09-01 09:49:28,302 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-09-01 09:49:28,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-09-01 09:49:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:49:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:49:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-09-01 09:49:28,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364341085271318 [2023-09-01 09:49:28,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-09-01 09:49:28,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-09-01 09:49:28,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:28,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-09-01 09:49:28,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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:49:28,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:28,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:28,339 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 346 transitions. [2023-09-01 09:49:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-09-01 09:49:28,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:49:28,343 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-09-01 09:49:28,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-09-01 09:49:28,348 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-09-01 09:49:28,348 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-09-01 09:49:28,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:49:28,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:28,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:28,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:49:28,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:28,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash 394905544, now seen corresponding path program 1 times [2023-09-01 09:49:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109816443] [2023-09-01 09:49:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:28,630 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:49:28,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109816443] [2023-09-01 09:49:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109816443] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:28,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:49:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594143572] [2023-09-01 09:49:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:28,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:49:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:49:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:49:28,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-09-01 09:49:28,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:49:28,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:28,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-09-01 09:49:28,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:29,092 INFO L130 PetriNetUnfolder]: 2459/3678 cut-off events. [2023-09-01 09:49:29,093 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-09-01 09:49:29,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18066 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7608. Up to 2550 conditions per place. [2023-09-01 09:49:29,110 INFO L137 encePairwiseOnDemand]: 207/215 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-09-01 09:49:29,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2023-09-01 09:49:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:49:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:49:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-09-01 09:49:29,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2023-09-01 09:49:29,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-09-01 09:49:29,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-09-01 09:49:29,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:29,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-09-01 09:49:29,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:49:29,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:29,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:29,119 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 321 transitions. [2023-09-01 09:49:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2023-09-01 09:49:29,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:49:29,121 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 106 flow [2023-09-01 09:49:29,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-09-01 09:49:29,122 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-09-01 09:49:29,122 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 106 flow [2023-09-01 09:49:29,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:49:29,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:29,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:29,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:49:29,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:29,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -642830926, now seen corresponding path program 1 times [2023-09-01 09:49:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653742787] [2023-09-01 09:49:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:29,352 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:49:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653742787] [2023-09-01 09:49:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653742787] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:49:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142140153] [2023-09-01 09:49:29,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:29,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:29,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-09-01 09:49:29,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:49:29,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:29,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-09-01 09:49:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:29,847 INFO L130 PetriNetUnfolder]: 2285/3424 cut-off events. [2023-09-01 09:49:29,848 INFO L131 PetriNetUnfolder]: For 1275/1275 co-relation queries the response was YES. [2023-09-01 09:49:29,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8557 conditions, 3424 events. 2285/3424 cut-off events. For 1275/1275 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16681 event pairs, 468 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8545. Up to 1837 conditions per place. [2023-09-01 09:49:29,866 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 48 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-09-01 09:49:29,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 288 flow [2023-09-01 09:49:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-09-01 09:49:29,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49186046511627907 [2023-09-01 09:49:29,868 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-09-01 09:49:29,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-09-01 09:49:29,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:29,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-09-01 09:49:29,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:49:29,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:49:29,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:49:29,873 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 106 flow. Second operand 4 states and 423 transitions. [2023-09-01 09:49:29,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 288 flow [2023-09-01 09:49:29,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:49:29,881 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 140 flow [2023-09-01 09:49:29,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-09-01 09:49:29,882 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-09-01 09:49:29,882 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 140 flow [2023-09-01 09:49:29,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:49:29,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:29,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:29,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:49:29,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:29,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1444226747, now seen corresponding path program 1 times [2023-09-01 09:49:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:29,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28749697] [2023-09-01 09:49:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:30,050 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:49:30,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28749697] [2023-09-01 09:49:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28749697] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:49:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843824651] [2023-09-01 09:49:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:30,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:30,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 215 [2023-09-01 09:49:30,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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:49:30,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:30,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 215 [2023-09-01 09:49:30,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:30,455 INFO L130 PetriNetUnfolder]: 2149/3224 cut-off events. [2023-09-01 09:49:30,455 INFO L131 PetriNetUnfolder]: For 2464/2464 co-relation queries the response was YES. [2023-09-01 09:49:30,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 3224 events. 2149/3224 cut-off events. For 2464/2464 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14754 event pairs, 634 based on Foata normal form. 40/3264 useless extension candidates. Maximal degree in co-relation 8539. Up to 1596 conditions per place. [2023-09-01 09:49:30,473 INFO L137 encePairwiseOnDemand]: 207/215 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-09-01 09:49:30,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 324 flow [2023-09-01 09:49:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-09-01 09:49:30,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872093023255814 [2023-09-01 09:49:30,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-09-01 09:49:30,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-09-01 09:49:30,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:30,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-09-01 09:49:30,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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:49:30,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:49:30,479 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:49:30,480 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 140 flow. Second operand 4 states and 419 transitions. [2023-09-01 09:49:30,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 324 flow [2023-09-01 09:49:30,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:30,484 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 226 flow [2023-09-01 09:49:30,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-09-01 09:49:30,485 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2023-09-01 09:49:30,485 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 226 flow [2023-09-01 09:49:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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:49:30,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:30,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:30,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:49:30,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:30,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1526699762, now seen corresponding path program 1 times [2023-09-01 09:49:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327458399] [2023-09-01 09:49:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:30,640 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:49:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327458399] [2023-09-01 09:49:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327458399] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:30,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:30,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815821750] [2023-09-01 09:49:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:30,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:30,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-09-01 09:49:30,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:30,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:30,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-09-01 09:49:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:31,011 INFO L130 PetriNetUnfolder]: 1301/2184 cut-off events. [2023-09-01 09:49:31,011 INFO L131 PetriNetUnfolder]: For 2266/2318 co-relation queries the response was YES. [2023-09-01 09:49:31,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 2184 events. 1301/2184 cut-off events. For 2266/2318 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12042 event pairs, 236 based on Foata normal form. 244/2395 useless extension candidates. Maximal degree in co-relation 5950. Up to 1136 conditions per place. [2023-09-01 09:49:31,024 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 74 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2023-09-01 09:49:31,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 665 flow [2023-09-01 09:49:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-09-01 09:49:31,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2023-09-01 09:49:31,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-09-01 09:49:31,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-09-01 09:49:31,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:31,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-09-01 09:49:31,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 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:49:31,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:49:31,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:49:31,032 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 226 flow. Second operand 5 states and 550 transitions. [2023-09-01 09:49:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 665 flow [2023-09-01 09:49:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:31,039 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 282 flow [2023-09-01 09:49:31,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-09-01 09:49:31,041 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-09-01 09:49:31,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 282 flow [2023-09-01 09:49:31,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:31,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:31,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:31,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:49:31,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:31,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -160325713, now seen corresponding path program 1 times [2023-09-01 09:49:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942716612] [2023-09-01 09:49:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:31,280 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:49:31,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942716612] [2023-09-01 09:49:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942716612] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439179057] [2023-09-01 09:49:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:31,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:31,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 215 [2023-09-01 09:49:31,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:49:31,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:31,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 215 [2023-09-01 09:49:31,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:31,761 INFO L130 PetriNetUnfolder]: 2047/3309 cut-off events. [2023-09-01 09:49:31,761 INFO L131 PetriNetUnfolder]: For 6395/6395 co-relation queries the response was YES. [2023-09-01 09:49:31,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12001 conditions, 3309 events. 2047/3309 cut-off events. For 6395/6395 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17991 event pairs, 122 based on Foata normal form. 36/3345 useless extension candidates. Maximal degree in co-relation 11978. Up to 1483 conditions per place. [2023-09-01 09:49:31,779 INFO L137 encePairwiseOnDemand]: 206/215 looper letters, 62 selfloop transitions, 23 changer transitions 14/99 dead transitions. [2023-09-01 09:49:31,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 766 flow [2023-09-01 09:49:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-09-01 09:49:31,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48186046511627906 [2023-09-01 09:49:31,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-09-01 09:49:31,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-09-01 09:49:31,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:31,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-09-01 09:49:31,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:49:31,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:49:31,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:49:31,786 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 282 flow. Second operand 5 states and 518 transitions. [2023-09-01 09:49:31,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 766 flow [2023-09-01 09:49:31,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:31,801 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 435 flow [2023-09-01 09:49:31,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-09-01 09:49:31,802 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-09-01 09:49:31,802 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 435 flow [2023-09-01 09:49:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:49:31,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:31,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:49:31,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:31,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 818513441, now seen corresponding path program 1 times [2023-09-01 09:49:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983853255] [2023-09-01 09:49:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:31,998 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:49:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983853255] [2023-09-01 09:49:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983853255] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901924303] [2023-09-01 09:49:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:32,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:32,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:32,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-09-01 09:49:32,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:49:32,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:32,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-09-01 09:49:32,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:32,293 INFO L130 PetriNetUnfolder]: 760/1404 cut-off events. [2023-09-01 09:49:32,293 INFO L131 PetriNetUnfolder]: For 2930/2991 co-relation queries the response was YES. [2023-09-01 09:49:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 1404 events. 760/1404 cut-off events. For 2930/2991 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7710 event pairs, 152 based on Foata normal form. 161/1547 useless extension candidates. Maximal degree in co-relation 4993. Up to 474 conditions per place. [2023-09-01 09:49:32,301 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 80 selfloop transitions, 11 changer transitions 20/129 dead transitions. [2023-09-01 09:49:32,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 129 transitions, 1197 flow [2023-09-01 09:49:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 661 transitions. [2023-09-01 09:49:32,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124031007751938 [2023-09-01 09:49:32,304 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 661 transitions. [2023-09-01 09:49:32,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 661 transitions. [2023-09-01 09:49:32,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:32,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 661 transitions. [2023-09-01 09:49:32,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:49:32,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:32,309 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:32,309 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 435 flow. Second operand 6 states and 661 transitions. [2023-09-01 09:49:32,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 129 transitions, 1197 flow [2023-09-01 09:49:32,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 129 transitions, 1181 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:32,319 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 515 flow [2023-09-01 09:49:32,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-09-01 09:49:32,320 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-09-01 09:49:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 515 flow [2023-09-01 09:49:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:49:32,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:32,321 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:49:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:49:32,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:32,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1189178268, now seen corresponding path program 1 times [2023-09-01 09:49:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139896018] [2023-09-01 09:49:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:32,587 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:49:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139896018] [2023-09-01 09:49:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139896018] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:49:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364810693] [2023-09-01 09:49:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:32,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:49:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:49:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:49:32,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-09-01 09:49:32,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:32,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:32,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-09-01 09:49:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:32,881 INFO L130 PetriNetUnfolder]: 714/1309 cut-off events. [2023-09-01 09:49:32,881 INFO L131 PetriNetUnfolder]: For 3401/3456 co-relation queries the response was YES. [2023-09-01 09:49:32,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 1309 events. 714/1309 cut-off events. For 3401/3456 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7140 event pairs, 145 based on Foata normal form. 46/1337 useless extension candidates. Maximal degree in co-relation 5289. Up to 451 conditions per place. [2023-09-01 09:49:32,889 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 67 selfloop transitions, 14 changer transitions 31/130 dead transitions. [2023-09-01 09:49:32,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 1243 flow [2023-09-01 09:49:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:49:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:49:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 858 transitions. [2023-09-01 09:49:32,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49883720930232556 [2023-09-01 09:49:32,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 858 transitions. [2023-09-01 09:49:32,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 858 transitions. [2023-09-01 09:49:32,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:32,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 858 transitions. [2023-09-01 09:49:32,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 0 states have call successors, (0), 0 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:49:32,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 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:49:32,898 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 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:49:32,898 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 515 flow. Second operand 8 states and 858 transitions. [2023-09-01 09:49:32,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 1243 flow [2023-09-01 09:49:32,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 130 transitions, 1187 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-09-01 09:49:32,925 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 501 flow [2023-09-01 09:49:32,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=501, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-09-01 09:49:32,925 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-09-01 09:49:32,926 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 501 flow [2023-09-01 09:49:32,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:32,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:32,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:32,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:49:32,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:32,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -224199300, now seen corresponding path program 1 times [2023-09-01 09:49:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700780374] [2023-09-01 09:49:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:33,434 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:49:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700780374] [2023-09-01 09:49:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700780374] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:33,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034217158] [2023-09-01 09:49:33,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:33,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:33,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-09-01 09:49:33,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 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:49:33,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:33,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-09-01 09:49:33,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:33,841 INFO L130 PetriNetUnfolder]: 1024/1954 cut-off events. [2023-09-01 09:49:33,841 INFO L131 PetriNetUnfolder]: For 6745/6845 co-relation queries the response was YES. [2023-09-01 09:49:33,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 1954 events. 1024/1954 cut-off events. For 6745/6845 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12434 event pairs, 194 based on Foata normal form. 17/1958 useless extension candidates. Maximal degree in co-relation 8105. Up to 971 conditions per place. [2023-09-01 09:49:33,851 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 66 selfloop transitions, 7 changer transitions 56/147 dead transitions. [2023-09-01 09:49:33,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 1431 flow [2023-09-01 09:49:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2023-09-01 09:49:33,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2023-09-01 09:49:33,854 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 654 transitions. [2023-09-01 09:49:33,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 654 transitions. [2023-09-01 09:49:33,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:33,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 654 transitions. [2023-09-01 09:49:33,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 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:49:33,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:33,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:33,860 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 501 flow. Second operand 6 states and 654 transitions. [2023-09-01 09:49:33,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 1431 flow [2023-09-01 09:49:33,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1247 flow, removed 46 selfloop flow, removed 8 redundant places. [2023-09-01 09:49:33,892 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 533 flow [2023-09-01 09:49:33,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-09-01 09:49:33,893 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-09-01 09:49:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 533 flow [2023-09-01 09:49:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 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:49:33,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:33,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:49:33,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:33,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1428258288, now seen corresponding path program 2 times [2023-09-01 09:49:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759460880] [2023-09-01 09:49:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:34,860 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:49:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759460880] [2023-09-01 09:49:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759460880] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:49:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71074085] [2023-09-01 09:49:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:34,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:49:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:49:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:49:34,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 215 [2023-09-01 09:49:34,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:49:34,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:34,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 215 [2023-09-01 09:49:34,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:35,310 INFO L130 PetriNetUnfolder]: 852/1697 cut-off events. [2023-09-01 09:49:35,310 INFO L131 PetriNetUnfolder]: For 6093/6249 co-relation queries the response was YES. [2023-09-01 09:49:35,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 1697 events. 852/1697 cut-off events. For 6093/6249 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10978 event pairs, 81 based on Foata normal form. 67/1753 useless extension candidates. Maximal degree in co-relation 7399. Up to 965 conditions per place. [2023-09-01 09:49:35,320 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 72 selfloop transitions, 4 changer transitions 32/126 dead transitions. [2023-09-01 09:49:35,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 126 transitions, 1168 flow [2023-09-01 09:49:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-09-01 09:49:35,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968992248062015 [2023-09-01 09:49:35,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-09-01 09:49:35,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-09-01 09:49:35,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:35,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-09-01 09:49:35,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:35,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:35,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:49:35,329 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 533 flow. Second operand 6 states and 641 transitions. [2023-09-01 09:49:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 126 transitions, 1168 flow [2023-09-01 09:49:35,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 1158 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 09:49:35,377 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 547 flow [2023-09-01 09:49:35,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-09-01 09:49:35,379 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2023-09-01 09:49:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 547 flow [2023-09-01 09:49:35,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:49:35,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:35,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:35,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:49:35,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:49:35,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1888012336, now seen corresponding path program 3 times [2023-09-01 09:49:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021249965] [2023-09-01 09:49:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:35,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:49:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:35,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:49:35,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:49:35,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:49:35,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:49:35,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:49:35,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:49:35,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:49:35,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:49:35,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:49:35,529 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:35,534 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:49:35,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:49:35,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:49:35 BasicIcfg [2023-09-01 09:49:35,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:49:35,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:49:35,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:49:35,617 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:49:35,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:49:23" (3/4) ... [2023-09-01 09:49:35,619 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:49:35,706 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:49:35,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:49:35,707 INFO L158 Benchmark]: Toolchain (without parser) took 13529.26ms. Allocated memory was 90.2MB in the beginning and 453.0MB in the end (delta: 362.8MB). Free memory was 68.8MB in the beginning and 346.8MB in the end (delta: -278.0MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,708 INFO L158 Benchmark]: CDTParser took 0.17ms. 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:49:35,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.01ms. Allocated memory is still 90.2MB. Free memory was 68.5MB in the beginning and 67.0MB in the end (delta: 1.6MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.18ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 64.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,708 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,709 INFO L158 Benchmark]: RCFGBuilder took 690.41ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 56.7MB in the end (delta: 5.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,709 INFO L158 Benchmark]: TraceAbstraction took 12023.98ms. Allocated memory was 90.2MB in the beginning and 453.0MB in the end (delta: 362.8MB). Free memory was 56.2MB in the beginning and 357.3MB in the end (delta: -301.1MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,709 INFO L158 Benchmark]: Witness Printer took 89.95ms. Allocated memory is still 453.0MB. Free memory was 357.3MB in the beginning and 346.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 09:49:35,711 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.17ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.01ms. Allocated memory is still 90.2MB. Free memory was 68.5MB in the beginning and 67.0MB in the end (delta: 1.6MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.18ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 64.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.41ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 56.7MB in the end (delta: 5.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12023.98ms. Allocated memory was 90.2MB in the beginning and 453.0MB in the end (delta: 362.8MB). Free memory was 56.2MB in the beginning and 357.3MB in the end (delta: -301.1MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 89.95ms. Allocated memory is still 453.0MB. Free memory was 357.3MB in the beginning and 346.8MB in the end (delta: 10.5MB). 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: 3.6s, 121 PlacesBefore, 35 PlacesAfterwards, 113 TransitionsBefore, 26 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 6373 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3208, independent: 2999, independent conditional: 0, independent unconditional: 2999, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1301, independent: 1257, independent conditional: 0, independent unconditional: 1257, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3208, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1301, unknown conditional: 0, unknown unconditional: 1301] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-3, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-2, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=-1, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 147 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: 11.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 61 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=10, InterpolantAutomatonStates: 50, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 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:49:35,744 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