./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_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 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:43:13,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:43:13,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:43:13,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:43:13,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:43:13,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:43:13,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:43:13,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:43:13,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:43:13,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:43:13,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:43:13,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:43:13,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:43:13,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:43:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:43:13,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:43:13,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:43:13,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:43:13,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:43:13,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:43:13,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:43:13,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:43:13,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:43:13,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:43:13,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:43:13,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:43:13,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:43:13,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:43:13,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:43:13,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:43:13,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:43:13,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:43:13,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:43:13,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:43:13,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:43:13,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:43:13,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:43:13,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:43:13,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:43:13,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:43:13,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:43:13,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:43:13,154 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:43:13,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:43:13,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:43:13,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:43:13,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:43:13,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:43:13,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:43:13,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:43:13,157 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:43:13,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:43:13,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:43:13,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:43:13,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:43:13,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:43:13,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:13,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:43:13,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:43:13,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:43:13,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:43:13,161 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:43:13,161 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 -> 118e824ffe62f75982c48ce1aa2c212500faccc3e6f3ef4066b7e12455b17249 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:43:13,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:43:13,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:43:13,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:43:13,450 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:43:13,450 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:43:13,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2023-09-01 09:43:14,347 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:43:14,603 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:43:14,604 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2023-09-01 09:43:14,621 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ca4c8a3/2ffe67bd117b4edebf9eb367dd98d45f/FLAGd0e44cd53 [2023-09-01 09:43:14,640 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ca4c8a3/2ffe67bd117b4edebf9eb367dd98d45f [2023-09-01 09:43:14,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:43:14,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:43:14,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:14,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:43:14,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:43:14,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:14" (1/1) ... [2023-09-01 09:43:14,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f7abdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:14, skipping insertion in model container [2023-09-01 09:43:14,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:14" (1/1) ... [2023-09-01 09:43:14,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:43:14,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:43:14,856 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/mix012_pso.opt_tso.opt.i[999,1012] [2023-09-01 09:43:15,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:15,040 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:43:15,049 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/mix012_pso.opt_tso.opt.i[999,1012] [2023-09-01 09:43:15,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:15,151 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:15,158 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:15,162 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:43:15,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15 WrapperNode [2023-09-01 09:43:15,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:15,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:15,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:43:15,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:43:15,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,228 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-09-01 09:43:15,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:15,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:43:15,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:43:15,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:43:15,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:43:15,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:43:15,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:43:15,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:43:15,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (1/1) ... [2023-09-01 09:43:15,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:43:15,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:43:15,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:43:15,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:43:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:43:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:43:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:43:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:43:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:43:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:43:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:43:15,332 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:43:15,476 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:43:15,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:43:15,686 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:43:15,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:43:15,823 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:43:15,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:15 BoogieIcfgContainer [2023-09-01 09:43:15,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:43:15,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:43:15,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:43:15,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:43:15,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:43:14" (1/3) ... [2023-09-01 09:43:15,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357a826f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:15, skipping insertion in model container [2023-09-01 09:43:15,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:15" (2/3) ... [2023-09-01 09:43:15,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357a826f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:15, skipping insertion in model container [2023-09-01 09:43:15,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:15" (3/3) ... [2023-09-01 09:43:15,833 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2023-09-01 09:43:15,839 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:43:15,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:43:15,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:43:15,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:43:15,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:43:15,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2023-09-01 09:43:15,966 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-09-01 09:43:15,967 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:43:15,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2023-09-01 09:43:15,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-09-01 09:43:15,978 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:43:15,987 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-09-01 09:43:15,989 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-09-01 09:43:15,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-09-01 09:43:16,013 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-09-01 09:43:16,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:16,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:43:16,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 1002 [2023-09-01 09:43:18,607 INFO L134 LiptonReduction]: Checked pairs total: 2307 [2023-09-01 09:43:18,607 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-09-01 09:43:18,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:43:18,620 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;@45c327c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:43:18,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:43:18,622 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-09-01 09:43:18,622 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:18,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:18,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:43:18,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:18,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash 411769988, now seen corresponding path program 1 times [2023-09-01 09:43:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654220208] [2023-09-01 09:43:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:18,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654220208] [2023-09-01 09:43:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654220208] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:18,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:18,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257164742] [2023-09-01 09:43:18,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:18,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:18,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:18,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 169 [2023-09-01 09:43:18,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:18,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:18,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 169 [2023-09-01 09:43:18,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:19,014 INFO L130 PetriNetUnfolder]: 142/271 cut-off events. [2023-09-01 09:43:19,014 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 09:43:19,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 988 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2023-09-01 09:43:19,016 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-09-01 09:43:19,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 96 flow [2023-09-01 09:43:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2023-09-01 09:43:19,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009861932938856 [2023-09-01 09:43:19,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 254 transitions. [2023-09-01 09:43:19,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 254 transitions. [2023-09-01 09:43:19,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:19,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 254 transitions. [2023-09-01 09:43:19,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,036 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 254 transitions. [2023-09-01 09:43:19,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 96 flow [2023-09-01 09:43:19,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:19,038 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-09-01 09:43:19,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-09-01 09:43:19,041 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-09-01 09:43:19,042 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-09-01 09:43:19,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:19,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:19,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:43:19,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:19,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash 574009765, now seen corresponding path program 1 times [2023-09-01 09:43:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039958817] [2023-09-01 09:43:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:19,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039958817] [2023-09-01 09:43:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039958817] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187752399] [2023-09-01 09:43:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:19,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:19,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 169 [2023-09-01 09:43:19,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:19,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 169 [2023-09-01 09:43:19,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:19,262 INFO L130 PetriNetUnfolder]: 127/228 cut-off events. [2023-09-01 09:43:19,262 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 09:43:19,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 228 events. 127/228 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 720 event pairs, 43 based on Foata normal form. 4/232 useless extension candidates. Maximal degree in co-relation 474. Up to 201 conditions per place. [2023-09-01 09:43:19,263 INFO L137 encePairwiseOnDemand]: 165/169 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-09-01 09:43:19,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 104 flow [2023-09-01 09:43:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-09-01 09:43:19,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48520710059171596 [2023-09-01 09:43:19,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-09-01 09:43:19,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-09-01 09:43:19,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:19,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-09-01 09:43:19,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,268 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 246 transitions. [2023-09-01 09:43:19,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 104 flow [2023-09-01 09:43:19,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:19,269 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-09-01 09:43:19,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-09-01 09:43:19,270 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-09-01 09:43:19,270 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-09-01 09:43:19,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:19,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:19,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:43:19,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:19,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2057697421, now seen corresponding path program 1 times [2023-09-01 09:43:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610073345] [2023-09-01 09:43:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610073345] [2023-09-01 09:43:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610073345] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293372228] [2023-09-01 09:43:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:19,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:19,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 169 [2023-09-01 09:43:19,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:19,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 169 [2023-09-01 09:43:19,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:19,514 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2023-09-01 09:43:19,515 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-09-01 09:43:19,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 218 events. 121/218 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 649 event pairs, 41 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 506. Up to 157 conditions per place. [2023-09-01 09:43:19,517 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2023-09-01 09:43:19,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 103 flow [2023-09-01 09:43:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2023-09-01 09:43:19,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47928994082840237 [2023-09-01 09:43:19,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 243 transitions. [2023-09-01 09:43:19,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 243 transitions. [2023-09-01 09:43:19,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:19,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 243 transitions. [2023-09-01 09:43:19,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,523 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 243 transitions. [2023-09-01 09:43:19,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 103 flow [2023-09-01 09:43:19,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:19,524 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 61 flow [2023-09-01 09:43:19,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-09-01 09:43:19,525 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-09-01 09:43:19,528 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 61 flow [2023-09-01 09:43:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:19,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:19,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:43:19,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:19,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1865761269, now seen corresponding path program 1 times [2023-09-01 09:43:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798126890] [2023-09-01 09:43:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798126890] [2023-09-01 09:43:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798126890] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098057378] [2023-09-01 09:43:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:19,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:19,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 169 [2023-09-01 09:43:19,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:19,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 169 [2023-09-01 09:43:19,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:19,934 INFO L130 PetriNetUnfolder]: 60/137 cut-off events. [2023-09-01 09:43:19,934 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-09-01 09:43:19,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 137 events. 60/137 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 444 event pairs, 23 based on Foata normal form. 20/157 useless extension candidates. Maximal degree in co-relation 329. Up to 58 conditions per place. [2023-09-01 09:43:19,936 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2023-09-01 09:43:19,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 177 flow [2023-09-01 09:43:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2023-09-01 09:43:19,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-09-01 09:43:19,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 325 transitions. [2023-09-01 09:43:19,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 325 transitions. [2023-09-01 09:43:19,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:19,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 325 transitions. [2023-09-01 09:43:19,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,943 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 61 flow. Second operand 4 states and 325 transitions. [2023-09-01 09:43:19,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 177 flow [2023-09-01 09:43:19,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:19,945 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 81 flow [2023-09-01 09:43:19,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-09-01 09:43:19,946 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-09-01 09:43:19,946 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 81 flow [2023-09-01 09:43:19,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:19,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:19,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:43:19,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:19,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1437647944, now seen corresponding path program 1 times [2023-09-01 09:43:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094464745] [2023-09-01 09:43:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094464745] [2023-09-01 09:43:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094464745] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:43:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006735493] [2023-09-01 09:43:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:20,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:43:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:43:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:43:20,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 169 [2023-09-01 09:43:20,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:20,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 169 [2023-09-01 09:43:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:20,359 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-09-01 09:43:20,359 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-09-01 09:43:20,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 67 events. 24/67 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 8 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 195. Up to 29 conditions per place. [2023-09-01 09:43:20,361 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 19 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2023-09-01 09:43:20,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 159 flow [2023-09-01 09:43:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2023-09-01 09:43:20,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46272189349112425 [2023-09-01 09:43:20,362 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 391 transitions. [2023-09-01 09:43:20,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 391 transitions. [2023-09-01 09:43:20,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:20,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 391 transitions. [2023-09-01 09:43:20,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.2) internal successors, (391), 5 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-09-01 09:43:20,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,365 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,365 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 81 flow. Second operand 5 states and 391 transitions. [2023-09-01 09:43:20,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 159 flow [2023-09-01 09:43:20,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 142 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 09:43:20,368 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 90 flow [2023-09-01 09:43:20,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-09-01 09:43:20,369 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-09-01 09:43:20,370 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 90 flow [2023-09-01 09:43:20,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:20,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:20,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:43:20,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:20,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1695977555, now seen corresponding path program 1 times [2023-09-01 09:43:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456255488] [2023-09-01 09:43:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456255488] [2023-09-01 09:43:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456255488] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730876872] [2023-09-01 09:43:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:20,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:20,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-09-01 09:43:20,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 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-09-01 09:43:20,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:20,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-09-01 09:43:20,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:20,641 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2023-09-01 09:43:20,642 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-09-01 09:43:20,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 71 events. 24/71 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 225. Up to 41 conditions per place. [2023-09-01 09:43:20,642 INFO L137 encePairwiseOnDemand]: 163/169 looper letters, 21 selfloop transitions, 7 changer transitions 10/38 dead transitions. [2023-09-01 09:43:20,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 252 flow [2023-09-01 09:43:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2023-09-01 09:43:20,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662721893491124 [2023-09-01 09:43:20,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2023-09-01 09:43:20,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2023-09-01 09:43:20,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:20,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2023-09-01 09:43:20,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,646 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 90 flow. Second operand 5 states and 394 transitions. [2023-09-01 09:43:20,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 252 flow [2023-09-01 09:43:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 190 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-09-01 09:43:20,648 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-09-01 09:43:20,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-09-01 09:43:20,648 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2023-09-01 09:43:20,649 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-09-01 09:43:20,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 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-09-01 09:43:20,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:20,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:43:20,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:20,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1514074523, now seen corresponding path program 2 times [2023-09-01 09:43:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:20,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788215037] [2023-09-01 09:43:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788215037] [2023-09-01 09:43:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788215037] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:20,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:43:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474447305] [2023-09-01 09:43:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:20,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:43:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:43:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:43:20,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-09-01 09:43:20,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:20,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-09-01 09:43:20,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:20,885 INFO L130 PetriNetUnfolder]: 17/64 cut-off events. [2023-09-01 09:43:20,885 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-09-01 09:43:20,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 64 events. 17/64 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 183. Up to 26 conditions per place. [2023-09-01 09:43:20,886 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 16 selfloop transitions, 3 changer transitions 14/33 dead transitions. [2023-09-01 09:43:20,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 193 flow [2023-09-01 09:43:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:43:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:43:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2023-09-01 09:43:20,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556213017751479 [2023-09-01 09:43:20,888 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 462 transitions. [2023-09-01 09:43:20,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 462 transitions. [2023-09-01 09:43:20,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:20,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 462 transitions. [2023-09-01 09:43:20,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,890 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,891 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 6 states and 462 transitions. [2023-09-01 09:43:20,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 193 flow [2023-09-01 09:43:20,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:20,892 INFO L231 Difference]: Finished difference. Result has 35 places, 17 transitions, 71 flow [2023-09-01 09:43:20,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=35, PETRI_TRANSITIONS=17} [2023-09-01 09:43:20,892 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2023-09-01 09:43:20,893 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 71 flow [2023-09-01 09:43:20,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:20,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:20,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:20,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:43:20,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:20,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1210556147, now seen corresponding path program 3 times [2023-09-01 09:43:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456706851] [2023-09-01 09:43:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456706851] [2023-09-01 09:43:21,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456706851] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:21,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:21,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363813357] [2023-09-01 09:43:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:21,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:43:21,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:43:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:43:21,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 169 [2023-09-01 09:43:21,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 17 transitions, 71 flow. Second operand has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:21,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:21,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 169 [2023-09-01 09:43:21,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:22,095 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2023-09-01 09:43:22,095 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2023-09-01 09:43:22,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 36 events. 6/36 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2023-09-01 09:43:22,096 INFO L137 encePairwiseOnDemand]: 162/169 looper letters, 12 selfloop transitions, 5 changer transitions 8/26 dead transitions. [2023-09-01 09:43:22,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 158 flow [2023-09-01 09:43:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:43:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:43:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2023-09-01 09:43:22,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245562130177515 [2023-09-01 09:43:22,098 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 574 transitions. [2023-09-01 09:43:22,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 574 transitions. [2023-09-01 09:43:22,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:22,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 574 transitions. [2023-09-01 09:43:22,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:22,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:22,101 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:22,101 INFO L175 Difference]: Start difference. First operand has 35 places, 17 transitions, 71 flow. Second operand 8 states and 574 transitions. [2023-09-01 09:43:22,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 158 flow [2023-09-01 09:43:22,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 136 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-09-01 09:43:22,102 INFO L231 Difference]: Finished difference. Result has 35 places, 17 transitions, 70 flow [2023-09-01 09:43:22,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=17} [2023-09-01 09:43:22,102 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2023-09-01 09:43:22,102 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 70 flow [2023-09-01 09:43:22,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.0) internal successors, (497), 7 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:22,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:22,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:43:22,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:22,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash 189631777, now seen corresponding path program 4 times [2023-09-01 09:43:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210156222] [2023-09-01 09:43:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:22,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:43:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:22,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:43:22,183 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:43:22,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:43:22,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-09-01 09:43:22,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:43:22,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:43:22,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-01 09:43:22,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:43:22,185 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-09-01 09:43:22,188 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:43:22,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:43:22,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:43:22 BasicIcfg [2023-09-01 09:43:22,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:43:22,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:43:22,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:43:22,236 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:43:22,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:15" (3/4) ... [2023-09-01 09:43:22,238 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:43:22,297 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:43:22,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:43:22,298 INFO L158 Benchmark]: Toolchain (without parser) took 7654.48ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 66.3MB in the beginning and 103.3MB in the end (delta: -37.0MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,298 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 62.9MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:43:22,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.71ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 66.6MB in the end (delta: -264.4kB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.92ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 63.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,298 INFO L158 Benchmark]: Boogie Preprocessor took 42.93ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:43:22,299 INFO L158 Benchmark]: RCFGBuilder took 552.69ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 58.8MB in the end (delta: 3.4MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,299 INFO L158 Benchmark]: TraceAbstraction took 6408.56ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 58.3MB in the beginning and 110.6MB in the end (delta: -52.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,299 INFO L158 Benchmark]: Witness Printer took 61.09ms. Allocated memory is still 192.9MB. Free memory was 110.6MB in the beginning and 103.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-09-01 09:43:22,301 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.53ms. Allocated memory is still 62.9MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.71ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 66.6MB in the end (delta: -264.4kB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.92ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 63.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.93ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 552.69ms. Allocated memory is still 90.2MB. Free memory was 62.3MB in the beginning and 58.8MB in the end (delta: 3.4MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6408.56ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 58.3MB in the beginning and 110.6MB in the end (delta: -52.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 61.09ms. Allocated memory is still 192.9MB. Free memory was 110.6MB in the beginning and 103.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 92 PlacesBefore, 24 PlacesAfterwards, 87 TransitionsBefore, 17 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 2307 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1197, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 585, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1197, independent: 539, independent conditional: 0, independent unconditional: 539, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 585, unknown conditional: 0, unknown unconditional: 585] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t311, ((void *)0), P0, ((void *)0))=-1, t311={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t312, ((void *)0), P1, ((void *)0))=0, t311={5:0}, t312={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L785] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L786] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L787] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L788] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L790] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t311={5:0}, t312={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 822]: 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: 824]: 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 5 procedures, 107 locations, 5 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: 6.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 27 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=6, InterpolantAutomatonStates: 37, 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.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:43:22,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE