./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:47:54,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:47:54,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:47:54,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:47:54,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:47:54,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:47:54,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:47:54,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:47:54,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:47:54,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:47:54,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:47:54,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:47:54,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:47:54,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:47:54,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:47:55,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:47:55,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:47:55,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:47:55,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:47:55,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:47:55,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:47:55,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:47:55,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:47:55,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:47:55,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:47:55,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:47:55,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:47:55,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:47:55,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:47:55,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:47:55,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:47:55,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:47:55,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:47:55,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:47:55,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:47:55,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:47:55,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:47:55,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:47:55,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:47:55,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:47:55,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:47:55,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:47:55,083 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:47:55,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:47:55,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:47:55,084 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:47:55,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:47:55,085 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:47:55,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:47:55,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:47:55,086 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:47:55,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:47:55,087 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:47:55,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:47:55,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:47:55,089 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:47:55,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:47:55,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:47:55,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:47:55,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:47:55,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:55,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:47:55,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:47:55,091 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:47:55,091 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:47:55,091 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:47:55,091 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:47:55,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:47:55,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:47:55,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:47:55,423 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:47:55,424 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:47:55,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-30 16:47:56,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:47:56,786 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:47:56,786 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-30 16:47:56,798 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a5b0f87/1f593a4df689432b83d09f388e752472/FLAGae9ba5087 [2023-08-30 16:47:56,814 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a5b0f87/1f593a4df689432b83d09f388e752472 [2023-08-30 16:47:56,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:47:56,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:47:56,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:56,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:47:56,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:47:56,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:56" (1/1) ... [2023-08-30 16:47:56,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f61420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:56, skipping insertion in model container [2023-08-30 16:47:56,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:56" (1/1) ... [2023-08-30 16:47:56,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:47:56,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:47:57,058 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-30 16:47:57,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:57,275 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:47:57,286 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-30 16:47:57,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:57,404 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:57,404 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:57,408 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:47:57,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57 WrapperNode [2023-08-30 16:47:57,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:57,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:57,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:47:57,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:47:57,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,452 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-30 16:47:57,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:57,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:47:57,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:47:57,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:47:57,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:47:57,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:47:57,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:47:57,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:47:57,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (1/1) ... [2023-08-30 16:47:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:57,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:47:57,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:47:57,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:47:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:47:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:47:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:47:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:47:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:47:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:47:57,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:47:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:47:57,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:47:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:47:57,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:47:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:47:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:47:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:47:57,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:47:57,565 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:47:57,695 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:47:57,696 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:47:58,114 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:47:58,232 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:47:58,232 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:47:58,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:58 BoogieIcfgContainer [2023-08-30 16:47:58,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:47:58,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:47:58,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:47:58,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:47:58,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:47:56" (1/3) ... [2023-08-30 16:47:58,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40983c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:58, skipping insertion in model container [2023-08-30 16:47:58,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:57" (2/3) ... [2023-08-30 16:47:58,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40983c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:58, skipping insertion in model container [2023-08-30 16:47:58,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:58" (3/3) ... [2023-08-30 16:47:58,241 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-30 16:47:58,248 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:47:58,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:47:58,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:47:58,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:47:58,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:47:58,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2023-08-30 16:47:58,406 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-08-30 16:47:58,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:58,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 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/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 16:47:58,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2023-08-30 16:47:58,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2023-08-30 16:47:58,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:47:58,437 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2023-08-30 16:47:58,441 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2023-08-30 16:47:58,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2023-08-30 16:47:58,481 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-08-30 16:47:58,481 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:58,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 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/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 16:47:58,485 INFO L119 LiptonReduction]: Number of co-enabled transitions 2240 [2023-08-30 16:48:01,723 INFO L134 LiptonReduction]: Checked pairs total: 6162 [2023-08-30 16:48:01,724 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 16:48:01,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:48:01,740 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;@88043c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:48:01,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:48:01,744 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:48:01,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:48:01,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:01,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:48:01,745 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-08-30 16:48:01,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 486512, now seen corresponding path program 1 times [2023-08-30 16:48:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781530722] [2023-08-30 16:48:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:02,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781530722] [2023-08-30 16:48:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781530722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:48:02,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999167682] [2023-08-30 16:48:02,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:02,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:02,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 208 [2023-08-30 16:48:02,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:02,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:02,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 208 [2023-08-30 16:48:02,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:02,624 INFO L130 PetriNetUnfolder]: 1616/2528 cut-off events. [2023-08-30 16:48:02,624 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 16:48:02,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 2528 events. 1616/2528 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14079 event pairs, 204 based on Foata normal form. 100/2424 useless extension candidates. Maximal degree in co-relation 4941. Up to 2013 conditions per place. [2023-08-30 16:48:02,650 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-08-30 16:48:02,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 181 flow [2023-08-30 16:48:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-30 16:48:02,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5496794871794872 [2023-08-30 16:48:02,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-30 16:48:02,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-30 16:48:02,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:02,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-30 16:48:02,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:02,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:02,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:02,677 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 343 transitions. [2023-08-30 16:48:02,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 181 flow [2023-08-30 16:48:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:48:02,681 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-08-30 16:48:02,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-08-30 16:48:02,686 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-08-30 16:48:02,686 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-08-30 16:48:02,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:02,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:02,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:02,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:48:02,688 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-08-30 16:48:02,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1072923167, now seen corresponding path program 1 times [2023-08-30 16:48:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808596069] [2023-08-30 16:48:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808596069] [2023-08-30 16:48:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808596069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:03,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:03,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:48:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889127806] [2023-08-30 16:48:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:03,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:03,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 208 [2023-08-30 16:48:03,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:03,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:03,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 208 [2023-08-30 16:48:03,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:03,740 INFO L130 PetriNetUnfolder]: 3613/5382 cut-off events. [2023-08-30 16:48:03,740 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2023-08-30 16:48:03,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11138 conditions, 5382 events. 3613/5382 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27875 event pairs, 1078 based on Foata normal form. 282/5664 useless extension candidates. Maximal degree in co-relation 11128. Up to 3167 conditions per place. [2023-08-30 16:48:03,765 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 38 selfloop transitions, 7 changer transitions 29/74 dead transitions. [2023-08-30 16:48:03,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 74 transitions, 316 flow [2023-08-30 16:48:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-08-30 16:48:03,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913461538461538 [2023-08-30 16:48:03,772 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-08-30 16:48:03,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-08-30 16:48:03,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:03,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-08-30 16:48:03,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:03,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:03,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:03,781 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 511 transitions. [2023-08-30 16:48:03,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 74 transitions, 316 flow [2023-08-30 16:48:03,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 74 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:03,783 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2023-08-30 16:48:03,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-30 16:48:03,784 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-30 16:48:03,784 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2023-08-30 16:48:03,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:03,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:03,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:03,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:48:03,785 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-08-30 16:48:03,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1099147507, now seen corresponding path program 1 times [2023-08-30 16:48:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961987392] [2023-08-30 16:48:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961987392] [2023-08-30 16:48:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961987392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113156833] [2023-08-30 16:48:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:48:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:48:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:48:04,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 208 [2023-08-30 16:48:04,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:04,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:04,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 208 [2023-08-30 16:48:04,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:04,734 INFO L130 PetriNetUnfolder]: 3155/4754 cut-off events. [2023-08-30 16:48:04,734 INFO L131 PetriNetUnfolder]: For 3243/3243 co-relation queries the response was YES. [2023-08-30 16:48:04,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12898 conditions, 4754 events. 3155/4754 cut-off events. For 3243/3243 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24071 event pairs, 701 based on Foata normal form. 272/5026 useless extension candidates. Maximal degree in co-relation 12884. Up to 2145 conditions per place. [2023-08-30 16:48:04,759 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 46 selfloop transitions, 7 changer transitions 38/91 dead transitions. [2023-08-30 16:48:04,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 91 transitions, 518 flow [2023-08-30 16:48:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2023-08-30 16:48:04,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766483516483517 [2023-08-30 16:48:04,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2023-08-30 16:48:04,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2023-08-30 16:48:04,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:04,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2023-08-30 16:48:04,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:04,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:04,768 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:04,769 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 7 states and 694 transitions. [2023-08-30 16:48:04,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 91 transitions, 518 flow [2023-08-30 16:48:04,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 91 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:04,792 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 168 flow [2023-08-30 16:48:04,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-30 16:48:04,793 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-08-30 16:48:04,796 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 168 flow [2023-08-30 16:48:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:04,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:04,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:04,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:48:04,797 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-08-30 16:48:04,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 380829509, now seen corresponding path program 1 times [2023-08-30 16:48:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215202529] [2023-08-30 16:48:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215202529] [2023-08-30 16:48:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215202529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:05,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:05,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:48:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210844691] [2023-08-30 16:48:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:05,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:05,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 208 [2023-08-30 16:48:05,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:05,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 208 [2023-08-30 16:48:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:05,529 INFO L130 PetriNetUnfolder]: 2107/3398 cut-off events. [2023-08-30 16:48:05,530 INFO L131 PetriNetUnfolder]: For 4351/4407 co-relation queries the response was YES. [2023-08-30 16:48:05,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 3398 events. 2107/3398 cut-off events. For 4351/4407 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18474 event pairs, 991 based on Foata normal form. 194/3552 useless extension candidates. Maximal degree in co-relation 9393. Up to 2089 conditions per place. [2023-08-30 16:48:05,549 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 35 selfloop transitions, 4 changer transitions 20/67 dead transitions. [2023-08-30 16:48:05,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 404 flow [2023-08-30 16:48:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-30 16:48:05,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2023-08-30 16:48:05,551 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-30 16:48:05,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-30 16:48:05,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:05,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-30 16:48:05,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,556 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 168 flow. Second operand 5 states and 528 transitions. [2023-08-30 16:48:05,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 404 flow [2023-08-30 16:48:05,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 391 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 16:48:05,569 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 173 flow [2023-08-30 16:48:05,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-30 16:48:05,570 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-08-30 16:48:05,570 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 173 flow [2023-08-30 16:48:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:05,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:05,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:48:05,571 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-08-30 16:48:05,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1648170075, now seen corresponding path program 1 times [2023-08-30 16:48:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891509381] [2023-08-30 16:48:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891509381] [2023-08-30 16:48:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891509381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:48:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560855397] [2023-08-30 16:48:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:05,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:05,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:05,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2023-08-30 16:48:05,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:05,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2023-08-30 16:48:05,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:05,980 INFO L130 PetriNetUnfolder]: 950/1637 cut-off events. [2023-08-30 16:48:05,980 INFO L131 PetriNetUnfolder]: For 1559/1682 co-relation queries the response was YES. [2023-08-30 16:48:05,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 1637 events. 950/1637 cut-off events. For 1559/1682 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8475 event pairs, 255 based on Foata normal form. 98/1705 useless extension candidates. Maximal degree in co-relation 4594. Up to 1241 conditions per place. [2023-08-30 16:48:05,990 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 40 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-30 16:48:05,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 342 flow [2023-08-30 16:48:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-30 16:48:05,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2023-08-30 16:48:05,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-30 16:48:05,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-30 16:48:05,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:05,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-30 16:48:05,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:05,995 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 173 flow. Second operand 3 states and 328 transitions. [2023-08-30 16:48:05,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 342 flow [2023-08-30 16:48:05,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 320 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 16:48:05,999 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 183 flow [2023-08-30 16:48:05,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-30 16:48:06,000 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-08-30 16:48:06,000 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 183 flow [2023-08-30 16:48:06,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:06,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:06,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:48:06,001 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-08-30 16:48:06,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 810919383, now seen corresponding path program 1 times [2023-08-30 16:48:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:06,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383637367] [2023-08-30 16:48:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383637367] [2023-08-30 16:48:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383637367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046944964] [2023-08-30 16:48:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:06,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:06,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2023-08-30 16:48:06,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:06,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2023-08-30 16:48:06,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:06,374 INFO L130 PetriNetUnfolder]: 455/865 cut-off events. [2023-08-30 16:48:06,375 INFO L131 PetriNetUnfolder]: For 517/558 co-relation queries the response was YES. [2023-08-30 16:48:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 865 events. 455/865 cut-off events. For 517/558 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4258 event pairs, 146 based on Foata normal form. 92/936 useless extension candidates. Maximal degree in co-relation 2695. Up to 304 conditions per place. [2023-08-30 16:48:06,380 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 53 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2023-08-30 16:48:06,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 440 flow [2023-08-30 16:48:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-08-30 16:48:06,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5264423076923077 [2023-08-30 16:48:06,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-08-30 16:48:06,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-08-30 16:48:06,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:06,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-08-30 16:48:06,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,386 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 183 flow. Second operand 4 states and 438 transitions. [2023-08-30 16:48:06,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 440 flow [2023-08-30 16:48:06,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:48:06,390 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 219 flow [2023-08-30 16:48:06,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-30 16:48:06,391 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2023-08-30 16:48:06,391 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 219 flow [2023-08-30 16:48:06,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:06,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:06,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:48:06,392 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-08-30 16:48:06,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -814251688, now seen corresponding path program 1 times [2023-08-30 16:48:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491968676] [2023-08-30 16:48:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491968676] [2023-08-30 16:48:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491968676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:48:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628198740] [2023-08-30 16:48:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:48:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:48:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:48:06,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 208 [2023-08-30 16:48:06,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:06,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 208 [2023-08-30 16:48:06,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:06,891 INFO L130 PetriNetUnfolder]: 393/730 cut-off events. [2023-08-30 16:48:06,891 INFO L131 PetriNetUnfolder]: For 850/886 co-relation queries the response was YES. [2023-08-30 16:48:06,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 730 events. 393/730 cut-off events. For 850/886 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3551 event pairs, 136 based on Foata normal form. 27/736 useless extension candidates. Maximal degree in co-relation 2421. Up to 304 conditions per place. [2023-08-30 16:48:06,896 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 49 selfloop transitions, 10 changer transitions 1/68 dead transitions. [2023-08-30 16:48:06,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 464 flow [2023-08-30 16:48:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-08-30 16:48:06,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2023-08-30 16:48:06,899 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-08-30 16:48:06,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-08-30 16:48:06,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:06,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-08-30 16:48:06,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,903 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 219 flow. Second operand 5 states and 535 transitions. [2023-08-30 16:48:06,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 464 flow [2023-08-30 16:48:06,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 432 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:06,907 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 220 flow [2023-08-30 16:48:06,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 16:48:06,908 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-08-30 16:48:06,908 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 220 flow [2023-08-30 16:48:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:06,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:06,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:06,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:48:06,909 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-08-30 16:48:06,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 919618780, now seen corresponding path program 1 times [2023-08-30 16:48:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336257676] [2023-08-30 16:48:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336257676] [2023-08-30 16:48:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336257676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:07,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566667732] [2023-08-30 16:48:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:07,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:48:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:48:07,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:48:07,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 208 [2023-08-30 16:48:07,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:07,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:07,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 208 [2023-08-30 16:48:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:07,635 INFO L130 PetriNetUnfolder]: 716/1247 cut-off events. [2023-08-30 16:48:07,636 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2023-08-30 16:48:07,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 1247 events. 716/1247 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6022 event pairs, 58 based on Foata normal form. 1/1248 useless extension candidates. Maximal degree in co-relation 4335. Up to 439 conditions per place. [2023-08-30 16:48:07,642 INFO L137 encePairwiseOnDemand]: 198/208 looper letters, 46 selfloop transitions, 9 changer transitions 48/103 dead transitions. [2023-08-30 16:48:07,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 103 transitions, 772 flow [2023-08-30 16:48:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2023-08-30 16:48:07,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-30 16:48:07,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2023-08-30 16:48:07,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2023-08-30 16:48:07,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:07,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2023-08-30 16:48:07,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:07,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:07,651 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:07,651 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 220 flow. Second operand 7 states and 672 transitions. [2023-08-30 16:48:07,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 103 transitions, 772 flow [2023-08-30 16:48:07,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 103 transitions, 666 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:07,659 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 192 flow [2023-08-30 16:48:07,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-30 16:48:07,660 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-30 16:48:07,660 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 192 flow [2023-08-30 16:48:07,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:07,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:07,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:07,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:48:07,661 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-08-30 16:48:07,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1747642146, now seen corresponding path program 2 times [2023-08-30 16:48:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856626289] [2023-08-30 16:48:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856626289] [2023-08-30 16:48:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856626289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:08,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:48:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534253827] [2023-08-30 16:48:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:08,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:48:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:48:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:48:08,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 208 [2023-08-30 16:48:08,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:08,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:08,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 208 [2023-08-30 16:48:08,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:09,302 INFO L130 PetriNetUnfolder]: 399/751 cut-off events. [2023-08-30 16:48:09,302 INFO L131 PetriNetUnfolder]: For 1217/1217 co-relation queries the response was YES. [2023-08-30 16:48:09,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 751 events. 399/751 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3505 event pairs, 24 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 2545. Up to 206 conditions per place. [2023-08-30 16:48:09,306 INFO L137 encePairwiseOnDemand]: 197/208 looper letters, 42 selfloop transitions, 13 changer transitions 54/109 dead transitions. [2023-08-30 16:48:09,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 779 flow [2023-08-30 16:48:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:48:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:48:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 916 transitions. [2023-08-30 16:48:09,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403846153846154 [2023-08-30 16:48:09,309 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 916 transitions. [2023-08-30 16:48:09,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 916 transitions. [2023-08-30 16:48:09,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:09,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 916 transitions. [2023-08-30 16:48:09,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 208.0) internal successors, (2288), 11 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,316 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 208.0) internal successors, (2288), 11 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,316 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 192 flow. Second operand 10 states and 916 transitions. [2023-08-30 16:48:09,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 779 flow [2023-08-30 16:48:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 726 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 16:48:09,322 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 211 flow [2023-08-30 16:48:09,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=211, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-08-30 16:48:09,323 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2023-08-30 16:48:09,323 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 211 flow [2023-08-30 16:48:09,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:09,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:09,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:48:09,324 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-08-30 16:48:09,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -767598454, now seen corresponding path program 3 times [2023-08-30 16:48:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932317896] [2023-08-30 16:48:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:48:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932317896] [2023-08-30 16:48:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932317896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:48:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479953394] [2023-08-30 16:48:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:09,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:48:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:48:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:48:09,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 208 [2023-08-30 16:48:09,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:09,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 208 [2023-08-30 16:48:09,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:09,785 INFO L130 PetriNetUnfolder]: 264/557 cut-off events. [2023-08-30 16:48:09,785 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2023-08-30 16:48:09,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 557 events. 264/557 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2607 event pairs, 113 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 1865. Up to 314 conditions per place. [2023-08-30 16:48:09,788 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 34 selfloop transitions, 4 changer transitions 23/61 dead transitions. [2023-08-30 16:48:09,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 437 flow [2023-08-30 16:48:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-08-30 16:48:09,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634615384615385 [2023-08-30 16:48:09,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-08-30 16:48:09,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-08-30 16:48:09,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:09,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-08-30 16:48:09,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,794 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 211 flow. Second operand 5 states and 482 transitions. [2023-08-30 16:48:09,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 437 flow [2023-08-30 16:48:09,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 420 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:09,798 INFO L231 Difference]: Finished difference. Result has 56 places, 30 transitions, 160 flow [2023-08-30 16:48:09,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=30} [2023-08-30 16:48:09,799 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-08-30 16:48:09,799 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 30 transitions, 160 flow [2023-08-30 16:48:09,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:09,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:09,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:09,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:48:09,800 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-08-30 16:48:09,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -951831062, now seen corresponding path program 4 times [2023-08-30 16:48:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770756840] [2023-08-30 16:48:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:48:09,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:48:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:48:09,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:48:09,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:48:09,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:48:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:48:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:48:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:48:09,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:48:09,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:48:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:48:09,953 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:09,958 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:48:09,958 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:48:10,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:48:10 BasicIcfg [2023-08-30 16:48:10,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:48:10,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:48:10,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:48:10,033 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:48:10,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:58" (3/4) ... [2023-08-30 16:48:10,034 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:48:10,120 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:48:10,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:48:10,121 INFO L158 Benchmark]: Toolchain (without parser) took 13298.23ms. Allocated memory was 75.5MB in the beginning and 763.4MB in the end (delta: 687.9MB). Free memory was 52.3MB in the beginning and 629.6MB in the end (delta: -577.3MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,121 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:48:10,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.01ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 48.6MB in the end (delta: 3.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 46.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,122 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 44.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:48:10,122 INFO L158 Benchmark]: RCFGBuilder took 748.52ms. Allocated memory is still 75.5MB. Free memory was 44.1MB in the beginning and 33.0MB in the end (delta: 11.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,122 INFO L158 Benchmark]: TraceAbstraction took 11795.65ms. Allocated memory was 75.5MB in the beginning and 763.4MB in the end (delta: 687.9MB). Free memory was 32.1MB in the beginning and 641.2MB in the end (delta: -609.1MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,123 INFO L158 Benchmark]: Witness Printer took 88.08ms. Allocated memory is still 763.4MB. Free memory was 641.2MB in the beginning and 629.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 16:48:10,124 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 60.8MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.01ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 48.6MB in the end (delta: 3.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 46.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 44.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 748.52ms. Allocated memory is still 75.5MB. Free memory was 44.1MB in the beginning and 33.0MB in the end (delta: 11.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11795.65ms. Allocated memory was 75.5MB in the beginning and 763.4MB in the end (delta: 687.9MB). Free memory was 32.1MB in the beginning and 641.2MB in the end (delta: -609.1MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Witness Printer took 88.08ms. Allocated memory is still 763.4MB. Free memory was 641.2MB in the beginning and 629.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 119 PlacesBefore, 37 PlacesAfterwards, 111 TransitionsBefore, 28 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 6162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2930, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1212, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2930, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-2, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=-1, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 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.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1379 IncrementalHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 64 mSDtfsCounter, 1379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 3.0s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 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-08-30 16:48:10,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE