./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --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:53:10,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:53:10,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:53:10,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:53:10,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:53:10,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:53:10,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:53:10,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:53:10,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:53:10,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:53:10,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:53:10,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:53:10,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:53:10,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:53:10,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:53:10,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:53:10,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:53:10,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:53:10,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:53:10,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:53:10,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:53:10,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:53:10,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:53:10,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:53:10,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:53:10,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:53:10,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:53:10,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:53:10,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:53:10,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:53:10,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:53:10,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:53:10,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:53:10,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:53:10,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:53:10,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:53:10,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:53:10,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:53:10,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:53:10,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:53:10,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:53:10,204 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:53:10,236 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:53:10,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:53:10,237 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:53:10,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:53:10,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:53:10,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:53:10,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:53:10,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:53:10,239 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:53:10,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:53:10,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:53:10,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:53:10,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:10,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:53:10,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:53:10,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:53:10,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:53:10,243 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:53:10,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:53:10,243 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:53:10,243 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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f 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:53:10,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:53:10,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:53:10,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:53:10,506 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:53:10,507 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:53:10,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:11,552 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:53:11,725 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:53:11,725 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:11,733 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cf74cfb/d04b9add75b24a9eb896f763f153e86f/FLAGade9e697b [2023-09-01 09:53:11,744 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cf74cfb/d04b9add75b24a9eb896f763f153e86f [2023-09-01 09:53:11,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:53:11,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:53:11,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:11,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:53:11,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:53:11,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:11" (1/1) ... [2023-09-01 09:53:11,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff1b0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:11, skipping insertion in model container [2023-09-01 09:53:11,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:11" (1/1) ... [2023-09-01 09:53:11,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:53:11,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:53:11,878 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-09-01 09:53:12,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:12,051 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:53:12,061 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-09-01 09:53:12,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:12,127 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:12,127 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:12,132 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:53:12,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12 WrapperNode [2023-09-01 09:53:12,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:12,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:12,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:53:12,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:53:12,138 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:53:12" (1/1) ... [2023-09-01 09:53:12,166 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:53:12" (1/1) ... [2023-09-01 09:53:12,183 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-09-01 09:53:12,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:12,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:53:12,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:53:12,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:53:12,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:53:12,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:53:12,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:53:12,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:53:12,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (1/1) ... [2023-09-01 09:53:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:53:12,221 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:53:12,245 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:53:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:53:12,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:53:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:53:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:53:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:53:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:53:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:53:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:53:12,269 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:53:12,349 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:53:12,351 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:53:12,541 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:53:12,715 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:53:12,715 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:53:12,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:12 BoogieIcfgContainer [2023-09-01 09:53:12,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:53:12,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:53:12,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:53:12,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:53:12,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:53:11" (1/3) ... [2023-09-01 09:53:12,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ecb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:12, skipping insertion in model container [2023-09-01 09:53:12,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:12" (2/3) ... [2023-09-01 09:53:12,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3ecb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:12, skipping insertion in model container [2023-09-01 09:53:12,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:12" (3/3) ... [2023-09-01 09:53:12,724 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:12,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:53:12,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:53:12,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:53:12,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:53:12,786 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:53:12,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-09-01 09:53:12,856 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-09-01 09:53:12,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:12,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-09-01 09:53:12,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-09-01 09:53:12,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-09-01 09:53:12,875 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:53:12,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-09-01 09:53:12,892 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-09-01 09:53:12,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-09-01 09:53:12,929 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-09-01 09:53:12,931 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-09-01 09:53:12,946 INFO L119 LiptonReduction]: Number of co-enabled transitions 1156 [2023-09-01 09:53:15,472 INFO L134 LiptonReduction]: Checked pairs total: 3436 [2023-09-01 09:53:15,472 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-09-01 09:53:15,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:53:15,487 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;@da4f1b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:53:15,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:53:15,489 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-09-01 09:53:15,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:15,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:15,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:53:15,491 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:53:15,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 393576756, now seen corresponding path program 1 times [2023-09-01 09:53:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211652854] [2023-09-01 09:53:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:15,771 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:53:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211652854] [2023-09-01 09:53:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211652854] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:15,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:15,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:53:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727603017] [2023-09-01 09:53:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:15,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:53:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:53:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:53:15,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 171 [2023-09-01 09:53:15,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:53:15,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:15,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 171 [2023-09-01 09:53:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:15,894 INFO L130 PetriNetUnfolder]: 159/338 cut-off events. [2023-09-01 09:53:15,895 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 09:53:15,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 338 events. 159/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1573 event pairs, 24 based on Foata normal form. 16/321 useless extension candidates. Maximal degree in co-relation 622. Up to 220 conditions per place. [2023-09-01 09:53:15,897 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 19 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2023-09-01 09:53:15,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 112 flow [2023-09-01 09:53:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:53:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:53:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-09-01 09:53:15,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165692007797271 [2023-09-01 09:53:15,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-09-01 09:53:15,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-09-01 09:53:15,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:15,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-09-01 09:53:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:53:15,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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:53:15,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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:53:15,916 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 265 transitions. [2023-09-01 09:53:15,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 112 flow [2023-09-01 09:53:15,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:15,919 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-09-01 09:53:15,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-09-01 09:53:15,923 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-09-01 09:53:15,923 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-09-01 09:53:15,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:53:15,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:15,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:15,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:53:15,924 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:53:15,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -214138189, now seen corresponding path program 1 times [2023-09-01 09:53:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521071520] [2023-09-01 09:53:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:16,636 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:53:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521071520] [2023-09-01 09:53:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521071520] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:16,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:53:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507154581] [2023-09-01 09:53:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:16,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:53:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:53:16,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:53:16,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-09-01 09:53:16,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:16,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:16,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-09-01 09:53:16,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:16,763 INFO L130 PetriNetUnfolder]: 167/306 cut-off events. [2023-09-01 09:53:16,763 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-09-01 09:53:16,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 306 events. 167/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1150 event pairs, 53 based on Foata normal form. 24/329 useless extension candidates. Maximal degree in co-relation 630. Up to 197 conditions per place. [2023-09-01 09:53:16,765 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2023-09-01 09:53:16,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 144 flow [2023-09-01 09:53:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:53:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:53:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2023-09-01 09:53:16,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2023-09-01 09:53:16,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 390 transitions. [2023-09-01 09:53:16,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 390 transitions. [2023-09-01 09:53:16,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:16,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 390 transitions. [2023-09-01 09:53:16,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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:53:16,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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:53:16,771 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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:53:16,771 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 390 transitions. [2023-09-01 09:53:16,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 144 flow [2023-09-01 09:53:16,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:16,772 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2023-09-01 09:53:16,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-09-01 09:53:16,773 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-09-01 09:53:16,773 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2023-09-01 09:53:16,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:16,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:16,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:16,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:53:16,774 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:53:16,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash -13532060, now seen corresponding path program 1 times [2023-09-01 09:53:16,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956548498] [2023-09-01 09:53:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:17,199 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:53:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956548498] [2023-09-01 09:53:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956548498] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268026095] [2023-09-01 09:53:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:17,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:17,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-09-01 09:53:17,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 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:53:17,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:17,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-09-01 09:53:17,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:17,368 INFO L130 PetriNetUnfolder]: 133/278 cut-off events. [2023-09-01 09:53:17,368 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-09-01 09:53:17,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 278 events. 133/278 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 37 based on Foata normal form. 15/293 useless extension candidates. Maximal degree in co-relation 604. Up to 182 conditions per place. [2023-09-01 09:53:17,372 INFO L137 encePairwiseOnDemand]: 164/171 looper letters, 26 selfloop transitions, 8 changer transitions 13/49 dead transitions. [2023-09-01 09:53:17,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 216 flow [2023-09-01 09:53:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:53:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:53:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 618 transitions. [2023-09-01 09:53:17,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517543859649123 [2023-09-01 09:53:17,374 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 618 transitions. [2023-09-01 09:53:17,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 618 transitions. [2023-09-01 09:53:17,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:17,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 618 transitions. [2023-09-01 09:53:17,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.25) internal successors, (618), 8 states have internal predecessors, (618), 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:53:17,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 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:53:17,378 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 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:53:17,379 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 8 states and 618 transitions. [2023-09-01 09:53:17,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 216 flow [2023-09-01 09:53:17,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 208 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:53:17,381 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2023-09-01 09:53:17,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-09-01 09:53:17,382 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-09-01 09:53:17,384 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2023-09-01 09:53:17,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 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:53:17,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:17,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:17,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:53:17,385 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:53:17,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1317134639, now seen corresponding path program 1 times [2023-09-01 09:53:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482098562] [2023-09-01 09:53:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:17,749 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:53:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482098562] [2023-09-01 09:53:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482098562] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897546842] [2023-09-01 09:53:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:17,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 171 [2023-09-01 09:53:17,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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:53:17,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:17,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 171 [2023-09-01 09:53:17,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:17,970 INFO L130 PetriNetUnfolder]: 129/270 cut-off events. [2023-09-01 09:53:17,971 INFO L131 PetriNetUnfolder]: For 269/275 co-relation queries the response was YES. [2023-09-01 09:53:17,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 270 events. 129/270 cut-off events. For 269/275 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1053 event pairs, 24 based on Foata normal form. 9/279 useless extension candidates. Maximal degree in co-relation 746. Up to 181 conditions per place. [2023-09-01 09:53:17,972 INFO L137 encePairwiseOnDemand]: 162/171 looper letters, 29 selfloop transitions, 13 changer transitions 7/51 dead transitions. [2023-09-01 09:53:17,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 291 flow [2023-09-01 09:53:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:53:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:53:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 605 transitions. [2023-09-01 09:53:17,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4422514619883041 [2023-09-01 09:53:17,974 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 605 transitions. [2023-09-01 09:53:17,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 605 transitions. [2023-09-01 09:53:17,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:17,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 605 transitions. [2023-09-01 09:53:17,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.625) internal successors, (605), 8 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:17,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 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:53:17,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 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:53:17,978 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 8 states and 605 transitions. [2023-09-01 09:53:17,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 291 flow [2023-09-01 09:53:17,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:17,980 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 190 flow [2023-09-01 09:53:17,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-09-01 09:53:17,981 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2023-09-01 09:53:17,981 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 190 flow [2023-09-01 09:53:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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:53:17,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:17,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:17,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:53:17,982 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:53:17,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 567904127, now seen corresponding path program 2 times [2023-09-01 09:53:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:17,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119712438] [2023-09-01 09:53:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:18,454 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:53:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119712438] [2023-09-01 09:53:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119712438] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995308090] [2023-09-01 09:53:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:18,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:18,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 171 [2023-09-01 09:53:18,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 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:53:18,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:18,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 171 [2023-09-01 09:53:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:18,744 INFO L130 PetriNetUnfolder]: 201/362 cut-off events. [2023-09-01 09:53:18,744 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2023-09-01 09:53:18,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 362 events. 201/362 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1288 event pairs, 44 based on Foata normal form. 12/374 useless extension candidates. Maximal degree in co-relation 1325. Up to 273 conditions per place. [2023-09-01 09:53:18,747 INFO L137 encePairwiseOnDemand]: 162/171 looper letters, 38 selfloop transitions, 21 changer transitions 9/68 dead transitions. [2023-09-01 09:53:18,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 509 flow [2023-09-01 09:53:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:53:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:53:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 741 transitions. [2023-09-01 09:53:18,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-09-01 09:53:18,750 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 741 transitions. [2023-09-01 09:53:18,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 741 transitions. [2023-09-01 09:53:18,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:18,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 741 transitions. [2023-09-01 09:53:18,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 74.1) internal successors, (741), 10 states have internal predecessors, (741), 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:53:18,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 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:53:18,753 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 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:53:18,754 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 190 flow. Second operand 10 states and 741 transitions. [2023-09-01 09:53:18,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 509 flow [2023-09-01 09:53:18,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 490 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:18,757 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 324 flow [2023-09-01 09:53:18,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=324, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-09-01 09:53:18,758 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 25 predicate places. [2023-09-01 09:53:18,758 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 324 flow [2023-09-01 09:53:18,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 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:53:18,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:18,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:18,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:53:18,759 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:53:18,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 595148477, now seen corresponding path program 3 times [2023-09-01 09:53:18,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:18,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213160307] [2023-09-01 09:53:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:19,124 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:53:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213160307] [2023-09-01 09:53:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213160307] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109186907] [2023-09-01 09:53:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:19,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:19,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 171 [2023-09-01 09:53:19,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 76.57142857142857) internal successors, (536), 7 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:19,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:19,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 171 [2023-09-01 09:53:19,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:19,273 INFO L130 PetriNetUnfolder]: 137/276 cut-off events. [2023-09-01 09:53:19,273 INFO L131 PetriNetUnfolder]: For 992/998 co-relation queries the response was YES. [2023-09-01 09:53:19,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 276 events. 137/276 cut-off events. For 992/998 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1062 event pairs, 42 based on Foata normal form. 11/287 useless extension candidates. Maximal degree in co-relation 1160. Up to 187 conditions per place. [2023-09-01 09:53:19,275 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 31 selfloop transitions, 18 changer transitions 5/57 dead transitions. [2023-09-01 09:53:19,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 535 flow [2023-09-01 09:53:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:53:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:53:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2023-09-01 09:53:19,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-09-01 09:53:19,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 486 transitions. [2023-09-01 09:53:19,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 486 transitions. [2023-09-01 09:53:19,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:19,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 486 transitions. [2023-09-01 09:53:19,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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:53:19,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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:53:19,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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:53:19,280 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 324 flow. Second operand 6 states and 486 transitions. [2023-09-01 09:53:19,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 535 flow [2023-09-01 09:53:19,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-09-01 09:53:19,284 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 364 flow [2023-09-01 09:53:19,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-09-01 09:53:19,284 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2023-09-01 09:53:19,284 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 364 flow [2023-09-01 09:53:19,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.57142857142857) internal successors, (536), 7 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:19,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:19,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:19,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:53:19,285 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:53:19,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash 204831843, now seen corresponding path program 1 times [2023-09-01 09:53:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998083353] [2023-09-01 09:53:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:19,425 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:53:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998083353] [2023-09-01 09:53:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998083353] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:53:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070513673] [2023-09-01 09:53:19,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:19,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:53:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:53:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:53:19,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 171 [2023-09-01 09:53:19,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:53:19,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:19,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 171 [2023-09-01 09:53:19,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:19,495 INFO L130 PetriNetUnfolder]: 65/160 cut-off events. [2023-09-01 09:53:19,495 INFO L131 PetriNetUnfolder]: For 793/801 co-relation queries the response was YES. [2023-09-01 09:53:19,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 160 events. 65/160 cut-off events. For 793/801 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 597 event pairs, 17 based on Foata normal form. 32/191 useless extension candidates. Maximal degree in co-relation 651. Up to 71 conditions per place. [2023-09-01 09:53:19,497 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 32 selfloop transitions, 6 changer transitions 17/61 dead transitions. [2023-09-01 09:53:19,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 549 flow [2023-09-01 09:53:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:53:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:53:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2023-09-01 09:53:19,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48771929824561405 [2023-09-01 09:53:19,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 417 transitions. [2023-09-01 09:53:19,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 417 transitions. [2023-09-01 09:53:19,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:19,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 417 transitions. [2023-09-01 09:53:19,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 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:53:19,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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:53:19,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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:53:19,501 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 364 flow. Second operand 5 states and 417 transitions. [2023-09-01 09:53:19,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 549 flow [2023-09-01 09:53:19,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 437 flow, removed 24 selfloop flow, removed 11 redundant places. [2023-09-01 09:53:19,503 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 214 flow [2023-09-01 09:53:19,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-09-01 09:53:19,504 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2023-09-01 09:53:19,504 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 214 flow [2023-09-01 09:53:19,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:53:19,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:19,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:53:19,505 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:53:19,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1251919722, now seen corresponding path program 1 times [2023-09-01 09:53:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467304317] [2023-09-01 09:53:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:19,651 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:53:19,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:19,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467304317] [2023-09-01 09:53:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467304317] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:53:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990282893] [2023-09-01 09:53:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:19,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:53:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:19,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:53:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:53:19,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 171 [2023-09-01 09:53:19,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 214 flow. Second operand has 5 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:53:19,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:19,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 171 [2023-09-01 09:53:19,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:19,717 INFO L130 PetriNetUnfolder]: 43/113 cut-off events. [2023-09-01 09:53:19,718 INFO L131 PetriNetUnfolder]: For 354/363 co-relation queries the response was YES. [2023-09-01 09:53:19,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 113 events. 43/113 cut-off events. For 354/363 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 6 based on Foata normal form. 16/128 useless extension candidates. Maximal degree in co-relation 423. Up to 32 conditions per place. [2023-09-01 09:53:19,719 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 30 selfloop transitions, 9 changer transitions 15/60 dead transitions. [2023-09-01 09:53:19,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 468 flow [2023-09-01 09:53:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:53:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:53:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 569 transitions. [2023-09-01 09:53:19,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753550543024227 [2023-09-01 09:53:19,721 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 569 transitions. [2023-09-01 09:53:19,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 569 transitions. [2023-09-01 09:53:19,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:19,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 569 transitions. [2023-09-01 09:53:19,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 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:53:19,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 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:53:19,723 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 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:53:19,724 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 214 flow. Second operand 7 states and 569 transitions. [2023-09-01 09:53:19,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 468 flow [2023-09-01 09:53:19,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 441 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:19,726 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 235 flow [2023-09-01 09:53:19,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-09-01 09:53:19,726 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2023-09-01 09:53:19,726 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 235 flow [2023-09-01 09:53:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:53:19,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:19,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:53:19,727 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:53:19,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -442071753, now seen corresponding path program 1 times [2023-09-01 09:53:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172268729] [2023-09-01 09:53:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:20,138 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:53:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172268729] [2023-09-01 09:53:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172268729] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000376133] [2023-09-01 09:53:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:20,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:53:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:53:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:53:20,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 171 [2023-09-01 09:53:20,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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:53:20,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:20,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 171 [2023-09-01 09:53:20,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:20,316 INFO L130 PetriNetUnfolder]: 80/189 cut-off events. [2023-09-01 09:53:20,316 INFO L131 PetriNetUnfolder]: For 517/521 co-relation queries the response was YES. [2023-09-01 09:53:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 189 events. 80/189 cut-off events. For 517/521 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 702 event pairs, 4 based on Foata normal form. 5/194 useless extension candidates. Maximal degree in co-relation 769. Up to 97 conditions per place. [2023-09-01 09:53:20,318 INFO L137 encePairwiseOnDemand]: 164/171 looper letters, 23 selfloop transitions, 3 changer transitions 39/67 dead transitions. [2023-09-01 09:53:20,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 566 flow [2023-09-01 09:53:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:53:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:53:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2023-09-01 09:53:20,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43609022556390975 [2023-09-01 09:53:20,319 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 522 transitions. [2023-09-01 09:53:20,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 522 transitions. [2023-09-01 09:53:20,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:20,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 522 transitions. [2023-09-01 09:53:20,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 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:53:20,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 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:53:20,322 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 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:53:20,323 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 235 flow. Second operand 7 states and 522 transitions. [2023-09-01 09:53:20,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 566 flow [2023-09-01 09:53:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 501 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-09-01 09:53:20,325 INFO L231 Difference]: Finished difference. Result has 56 places, 25 transitions, 146 flow [2023-09-01 09:53:20,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=25} [2023-09-01 09:53:20,326 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-09-01 09:53:20,326 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 25 transitions, 146 flow [2023-09-01 09:53:20,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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:53:20,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:20,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:20,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:53:20,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:53:20,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1890217341, now seen corresponding path program 2 times [2023-09-01 09:53:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319568545] [2023-09-01 09:53:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:20,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:53:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:20,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:53:20,391 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:53:20,392 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:53:20,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-09-01 09:53:20,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:53:20,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:53:20,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-01 09:53:20,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:53:20,394 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-09-01 09:53:20,398 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:53:20,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:53:20,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:53:20 BasicIcfg [2023-09-01 09:53:20,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:53:20,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:53:20,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:53:20,429 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:53:20,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:12" (3/4) ... [2023-09-01 09:53:20,431 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:53:20,480 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:53:20,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:53:20,481 INFO L158 Benchmark]: Toolchain (without parser) took 8733.99ms. Allocated memory was 77.6MB in the beginning and 356.5MB in the end (delta: 278.9MB). Free memory was 53.5MB in the beginning and 327.1MB in the end (delta: -273.5MB). Peak memory consumption was 168.9MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,481 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 52.4MB. Free memory was 30.7MB in the beginning and 30.7MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:53:20,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.72ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 51.0MB in the end (delta: 2.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.40ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,482 INFO L158 Benchmark]: Boogie Preprocessor took 17.30ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 46.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,482 INFO L158 Benchmark]: RCFGBuilder took 515.49ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 46.3MB in the beginning and 67.9MB in the end (delta: -21.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,483 INFO L158 Benchmark]: TraceAbstraction took 7709.19ms. Allocated memory was 109.1MB in the beginning and 278.9MB in the end (delta: 169.9MB). Free memory was 66.8MB in the beginning and 93.8MB in the end (delta: -27.0MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,483 INFO L158 Benchmark]: Witness Printer took 52.06ms. Allocated memory was 278.9MB in the beginning and 356.5MB in the end (delta: 77.6MB). Free memory was 93.8MB in the beginning and 327.1MB in the end (delta: -233.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-09-01 09:53:20,484 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.12ms. Allocated memory is still 52.4MB. Free memory was 30.7MB in the beginning and 30.7MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.72ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 51.0MB in the end (delta: 2.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.40ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.30ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 46.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.49ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 46.3MB in the beginning and 67.9MB in the end (delta: -21.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7709.19ms. Allocated memory was 109.1MB in the beginning and 278.9MB in the end (delta: 169.9MB). Free memory was 66.8MB in the beginning and 93.8MB in the end (delta: -27.0MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Witness Printer took 52.06ms. Allocated memory was 278.9MB in the beginning and 356.5MB in the end (delta: 77.6MB). Free memory was 93.8MB in the beginning and 327.1MB in the end (delta: -233.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1277, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1277, independent: 504, independent conditional: 0, independent unconditional: 504, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=1, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 z = 1 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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, 111 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: 7.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1026 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 37 mSDtfsCounter, 1026 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 1085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:53:20,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE