./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:08:43,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:08:43,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:08:43,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:08:43,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:08:43,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:08:43,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:08:43,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:08:43,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:08:43,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:08:43,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:08:43,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:08:43,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:08:43,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:08:43,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:08:43,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:08:43,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:08:43,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:08:43,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:08:43,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:08:43,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:08:43,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:08:43,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:08:43,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:08:43,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:08:43,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:08:43,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:08:43,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:08:43,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:08:43,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:08:43,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:08:43,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:08:43,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:08:43,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:08:43,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:08:43,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:08:43,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:08:43,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:08:43,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:08:43,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:08:43,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:08:43,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:08:43,346 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:08:43,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:08:43,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:08:43,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:08:43,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:08:43,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:08:43,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:08:43,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:08:43,349 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:08:43,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:08:43,350 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:08:43,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:08:43,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:08:43,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:08:43,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:08:43,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:08:43,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:08:43,352 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:08:43,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:08:43,352 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:08:43,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:08:43,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:08:43,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:08:43,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:08:43,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:43,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:08:43,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:08:43,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:08:43,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:08:43,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:08:43,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:08:43,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:08:43,355 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:08:43,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:08:43,355 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:08:43,355 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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 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 -> TOGETHER [2023-08-30 23:08:43,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:08:43,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:08:43,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:08:43,704 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:08:43,704 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:08:43,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:08:44,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:08:45,146 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:08:45,147 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:08:45,165 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af163b6e1/8eaabed3c2694c9d9ad6fc422ec6edc0/FLAGc70c12472 [2023-08-30 23:08:45,181 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af163b6e1/8eaabed3c2694c9d9ad6fc422ec6edc0 [2023-08-30 23:08:45,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:08:45,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:08:45,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:45,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:08:45,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:08:45,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab32e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45, skipping insertion in model container [2023-08-30 23:08:45,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:08:45,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:08:45,428 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:08:45,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:45,652 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:08:45,664 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 23:08:45,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:45,764 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:45,764 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:45,769 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:08:45,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45 WrapperNode [2023-08-30 23:08:45,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:45,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:45,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:08:45,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:08:45,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,815 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 23:08:45,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:45,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:08:45,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:08:45,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:08:45,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,842 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:08:45,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:08:45,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:08:45,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:08:45,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (1/1) ... [2023-08-30 23:08:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:08:45,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:08:45,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:08:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:08:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:08:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:08:45,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:08:45,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:08:45,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:08:45,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:08:45,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:08:45,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:08:45,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:08:45,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:08:45,934 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:08:45,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:08:45,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:08:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:08:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:08:45,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:08:45,936 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:08:46,074 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:08:46,076 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:08:46,424 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:08:46,593 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:08:46,593 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:08:46,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:46 BoogieIcfgContainer [2023-08-30 23:08:46,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:08:46,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:08:46,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:08:46,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:08:46,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:08:45" (1/3) ... [2023-08-30 23:08:46,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9959072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:46, skipping insertion in model container [2023-08-30 23:08:46,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:45" (2/3) ... [2023-08-30 23:08:46,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9959072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:46, skipping insertion in model container [2023-08-30 23:08:46,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:46" (3/3) ... [2023-08-30 23:08:46,604 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 23:08:46,611 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:08:46,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:08:46,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:08:46,621 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:08:46,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:08:46,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 23:08:46,769 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 23:08:46,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:46,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:08:46,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 23:08:46,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-30 23:08:46,794 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:08:46,801 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 23:08:46,804 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 23:08:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-30 23:08:46,830 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 23:08:46,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:46,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:08:46,833 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-08-30 23:08:50,863 INFO L134 LiptonReduction]: Checked pairs total: 9486 [2023-08-30 23:08:50,864 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-30 23:08:50,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:08:50,882 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;@7d702d1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:08:50,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:08:50,885 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 23:08:50,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:50,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:50,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:08:50,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:50,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 553530, now seen corresponding path program 1 times [2023-08-30 23:08:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124979944] [2023-08-30 23:08:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124979944] [2023-08-30 23:08:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124979944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530456126] [2023-08-30 23:08:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:51,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:51,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:51,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 241 [2023-08-30 23:08:51,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:51,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:51,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 241 [2023-08-30 23:08:51,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:52,289 INFO L130 PetriNetUnfolder]: 4903/6754 cut-off events. [2023-08-30 23:08:52,290 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-08-30 23:08:52,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13602 conditions, 6754 events. 4903/6754 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 33861 event pairs, 2535 based on Foata normal form. 0/6412 useless extension candidates. Maximal degree in co-relation 13590. Up to 5335 conditions per place. [2023-08-30 23:08:52,328 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-30 23:08:52,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-08-30 23:08:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-30 23:08:52,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518672199170125 [2023-08-30 23:08:52,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-30 23:08:52,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-30 23:08:52,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:52,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-30 23:08:52,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:52,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:52,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:52,355 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 399 transitions. [2023-08-30 23:08:52,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-08-30 23:08:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:52,360 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-30 23:08:52,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 23:08:52,364 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 23:08:52,365 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-30 23:08:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:52,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:52,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:52,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:08:52,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:52,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1282591457, now seen corresponding path program 1 times [2023-08-30 23:08:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244803472] [2023-08-30 23:08:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244803472] [2023-08-30 23:08:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244803472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:52,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:52,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446770774] [2023-08-30 23:08:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:52,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:52,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:52,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:52,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:08:52,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:52,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:52,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:08:52,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:55,030 INFO L130 PetriNetUnfolder]: 17583/23844 cut-off events. [2023-08-30 23:08:55,030 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2023-08-30 23:08:55,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49052 conditions, 23844 events. 17583/23844 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 126413 event pairs, 6559 based on Foata normal form. 548/24392 useless extension candidates. Maximal degree in co-relation 49042. Up to 16827 conditions per place. [2023-08-30 23:08:55,153 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 23:08:55,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2023-08-30 23:08:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 23:08:55,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145228215767634 [2023-08-30 23:08:55,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 23:08:55,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 23:08:55,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:55,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 23:08:55,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:55,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:55,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:55,161 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 372 transitions. [2023-08-30 23:08:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2023-08-30 23:08:55,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:55,163 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2023-08-30 23:08:55,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-30 23:08:55,164 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-30 23:08:55,164 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2023-08-30 23:08:55,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:55,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:55,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:55,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:08:55,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:55,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1105627356, now seen corresponding path program 1 times [2023-08-30 23:08:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380709554] [2023-08-30 23:08:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380709554] [2023-08-30 23:08:55,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380709554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:55,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:55,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722600991] [2023-08-30 23:08:55,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:55,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:55,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:08:55,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:55,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:55,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:08:55,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:57,305 INFO L130 PetriNetUnfolder]: 16247/22060 cut-off events. [2023-08-30 23:08:57,306 INFO L131 PetriNetUnfolder]: For 7894/7894 co-relation queries the response was YES. [2023-08-30 23:08:57,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54412 conditions, 22060 events. 16247/22060 cut-off events. For 7894/7894 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 117382 event pairs, 3347 based on Foata normal form. 280/22340 useless extension candidates. Maximal degree in co-relation 54400. Up to 11689 conditions per place. [2023-08-30 23:08:57,435 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 66 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2023-08-30 23:08:57,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 382 flow [2023-08-30 23:08:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:08:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:08:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-30 23:08:57,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114107883817427 [2023-08-30 23:08:57,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-30 23:08:57,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-30 23:08:57,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:57,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-30 23:08:57,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:57,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:57,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:57,442 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 493 transitions. [2023-08-30 23:08:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 382 flow [2023-08-30 23:08:57,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:57,558 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 170 flow [2023-08-30 23:08:57,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-30 23:08:57,560 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-30 23:08:57,562 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 170 flow [2023-08-30 23:08:57,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:57,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:57,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:57,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:08:57,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:57,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1595310441, now seen corresponding path program 1 times [2023-08-30 23:08:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275695923] [2023-08-30 23:08:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275695923] [2023-08-30 23:08:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275695923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041008540] [2023-08-30 23:08:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:57,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 241 [2023-08-30 23:08:57,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:57,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:57,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 241 [2023-08-30 23:08:57,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:59,054 INFO L130 PetriNetUnfolder]: 11188/15901 cut-off events. [2023-08-30 23:08:59,055 INFO L131 PetriNetUnfolder]: For 6170/6606 co-relation queries the response was YES. [2023-08-30 23:08:59,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37618 conditions, 15901 events. 11188/15901 cut-off events. For 6170/6606 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 90164 event pairs, 3950 based on Foata normal form. 192/15664 useless extension candidates. Maximal degree in co-relation 37603. Up to 10621 conditions per place. [2023-08-30 23:08:59,134 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 38 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-30 23:08:59,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 282 flow [2023-08-30 23:08:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-30 23:08:59,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325034578146611 [2023-08-30 23:08:59,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-30 23:08:59,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-30 23:08:59,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:59,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-30 23:08:59,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:59,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:59,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:59,140 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 170 flow. Second operand 3 states and 385 transitions. [2023-08-30 23:08:59,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 282 flow [2023-08-30 23:08:59,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:08:59,155 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 181 flow [2023-08-30 23:08:59,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-30 23:08:59,156 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-30 23:08:59,156 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 181 flow [2023-08-30 23:08:59,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:59,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:59,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:59,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:08:59,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:59,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 141468959, now seen corresponding path program 1 times [2023-08-30 23:08:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:59,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884542938] [2023-08-30 23:08:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:59,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884542938] [2023-08-30 23:08:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884542938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:59,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:59,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768872220] [2023-08-30 23:08:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:59,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:59,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:59,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:08:59,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:59,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:59,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:08:59,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:00,485 INFO L130 PetriNetUnfolder]: 9230/13734 cut-off events. [2023-08-30 23:09:00,485 INFO L131 PetriNetUnfolder]: For 4772/5184 co-relation queries the response was YES. [2023-08-30 23:09:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31889 conditions, 13734 events. 9230/13734 cut-off events. For 4772/5184 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 87573 event pairs, 1743 based on Foata normal form. 1153/14481 useless extension candidates. Maximal degree in co-relation 31872. Up to 8290 conditions per place. [2023-08-30 23:09:00,561 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 72 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2023-08-30 23:09:00,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 509 flow [2023-08-30 23:09:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:09:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:09:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-30 23:09:00,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120331950207468 [2023-08-30 23:09:00,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-30 23:09:00,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-30 23:09:00,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:00,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-30 23:09:00,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:00,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:00,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:00,578 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 181 flow. Second operand 5 states and 617 transitions. [2023-08-30 23:09:00,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 509 flow [2023-08-30 23:09:00,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:00,588 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 248 flow [2023-08-30 23:09:00,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-30 23:09:00,590 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-30 23:09:00,591 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 248 flow [2023-08-30 23:09:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:00,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:00,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:00,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:09:00,592 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:00,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:00,592 INFO L85 PathProgramCache]: Analyzing trace with hash 366200139, now seen corresponding path program 1 times [2023-08-30 23:09:00,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:00,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432961825] [2023-08-30 23:09:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432961825] [2023-08-30 23:09:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432961825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717650308] [2023-08-30 23:09:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:00,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:09:00,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:00,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:00,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:09:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:02,081 INFO L130 PetriNetUnfolder]: 7526/11529 cut-off events. [2023-08-30 23:09:02,081 INFO L131 PetriNetUnfolder]: For 7625/7942 co-relation queries the response was YES. [2023-08-30 23:09:02,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34167 conditions, 11529 events. 7526/11529 cut-off events. For 7625/7942 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 75379 event pairs, 1000 based on Foata normal form. 757/11959 useless extension candidates. Maximal degree in co-relation 34147. Up to 3543 conditions per place. [2023-08-30 23:09:02,135 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 100 selfloop transitions, 19 changer transitions 0/132 dead transitions. [2023-08-30 23:09:02,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 132 transitions, 792 flow [2023-08-30 23:09:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-08-30 23:09:02,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133372851215174 [2023-08-30 23:09:02,139 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-08-30 23:09:02,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-08-30 23:09:02,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:02,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-08-30 23:09:02,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:02,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:02,145 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:02,145 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 248 flow. Second operand 7 states and 866 transitions. [2023-08-30 23:09:02,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 132 transitions, 792 flow [2023-08-30 23:09:02,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 132 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:09:02,210 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 377 flow [2023-08-30 23:09:02,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-08-30 23:09:02,211 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-08-30 23:09:02,211 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 377 flow [2023-08-30 23:09:02,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:02,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:02,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:02,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:09:02,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:02,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 251352945, now seen corresponding path program 1 times [2023-08-30 23:09:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973430698] [2023-08-30 23:09:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973430698] [2023-08-30 23:09:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973430698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624503382] [2023-08-30 23:09:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:02,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:02,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-30 23:09:02,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:02,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:02,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-30 23:09:02,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:04,441 INFO L130 PetriNetUnfolder]: 15568/22532 cut-off events. [2023-08-30 23:09:04,441 INFO L131 PetriNetUnfolder]: For 52561/52561 co-relation queries the response was YES. [2023-08-30 23:09:04,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84084 conditions, 22532 events. 15568/22532 cut-off events. For 52561/52561 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 137174 event pairs, 1223 based on Foata normal form. 66/22598 useless extension candidates. Maximal degree in co-relation 84060. Up to 8898 conditions per place. [2023-08-30 23:09:04,540 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 113 selfloop transitions, 24 changer transitions 63/200 dead transitions. [2023-08-30 23:09:04,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 200 transitions, 1756 flow [2023-08-30 23:09:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:09:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:09:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-08-30 23:09:04,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069156293222683 [2023-08-30 23:09:04,544 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-08-30 23:09:04,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-08-30 23:09:04,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:04,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-08-30 23:09:04,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:04,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:04,549 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:04,549 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 377 flow. Second operand 6 states and 733 transitions. [2023-08-30 23:09:04,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 200 transitions, 1756 flow [2023-08-30 23:09:05,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 200 transitions, 1536 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-08-30 23:09:05,318 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 404 flow [2023-08-30 23:09:05,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2023-08-30 23:09:05,319 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-08-30 23:09:05,319 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 404 flow [2023-08-30 23:09:05,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:05,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:05,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:05,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:09:05,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:05,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1650064438, now seen corresponding path program 1 times [2023-08-30 23:09:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:05,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973790615] [2023-08-30 23:09:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:05,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:05,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973790615] [2023-08-30 23:09:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973790615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:05,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990664145] [2023-08-30 23:09:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:05,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:09:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:09:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:09:05,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:09:05,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:05,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:05,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:09:05,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:06,404 INFO L130 PetriNetUnfolder]: 4622/7405 cut-off events. [2023-08-30 23:09:06,404 INFO L131 PetriNetUnfolder]: For 10723/10834 co-relation queries the response was YES. [2023-08-30 23:09:06,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23113 conditions, 7405 events. 4622/7405 cut-off events. For 10723/10834 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 47674 event pairs, 1087 based on Foata normal form. 381/7526 useless extension candidates. Maximal degree in co-relation 23087. Up to 2516 conditions per place. [2023-08-30 23:09:06,444 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 102 selfloop transitions, 18 changer transitions 14/155 dead transitions. [2023-08-30 23:09:06,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 155 transitions, 1152 flow [2023-08-30 23:09:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-08-30 23:09:06,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139300533491404 [2023-08-30 23:09:06,447 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-08-30 23:09:06,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-08-30 23:09:06,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:06,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-08-30 23:09:06,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:06,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:06,452 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:06,452 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 404 flow. Second operand 7 states and 867 transitions. [2023-08-30 23:09:06,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 155 transitions, 1152 flow [2023-08-30 23:09:06,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 155 transitions, 1114 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-30 23:09:06,480 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 528 flow [2023-08-30 23:09:06,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=528, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2023-08-30 23:09:06,481 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2023-08-30 23:09:06,481 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 528 flow [2023-08-30 23:09:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:06,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:06,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:06,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:09:06,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:06,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1197376372, now seen corresponding path program 1 times [2023-08-30 23:09:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876313187] [2023-08-30 23:09:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876313187] [2023-08-30 23:09:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876313187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7057357] [2023-08-30 23:09:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:09:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:09:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:09:07,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-30 23:09:07,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:07,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:07,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-30 23:09:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:08,387 INFO L130 PetriNetUnfolder]: 6773/11254 cut-off events. [2023-08-30 23:09:08,388 INFO L131 PetriNetUnfolder]: For 24319/24568 co-relation queries the response was YES. [2023-08-30 23:09:08,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41900 conditions, 11254 events. 6773/11254 cut-off events. For 24319/24568 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 81676 event pairs, 1252 based on Foata normal form. 65/11082 useless extension candidates. Maximal degree in co-relation 41872. Up to 3896 conditions per place. [2023-08-30 23:09:08,444 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 111 selfloop transitions, 7 changer transitions 64/203 dead transitions. [2023-08-30 23:09:08,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 203 transitions, 1898 flow [2023-08-30 23:09:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-30 23:09:08,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157083580320095 [2023-08-30 23:09:08,447 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-30 23:09:08,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-30 23:09:08,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:08,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-30 23:09:08,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:08,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:08,452 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:08,453 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 528 flow. Second operand 7 states and 870 transitions. [2023-08-30 23:09:08,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 203 transitions, 1898 flow [2023-08-30 23:09:08,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 203 transitions, 1592 flow, removed 124 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:08,895 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 524 flow [2023-08-30 23:09:08,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2023-08-30 23:09:08,896 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-08-30 23:09:08,896 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 524 flow [2023-08-30 23:09:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:08,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:08,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:09:08,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:08,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash -405995740, now seen corresponding path program 2 times [2023-08-30 23:09:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:08,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634770536] [2023-08-30 23:09:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634770536] [2023-08-30 23:09:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634770536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:09:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506843191] [2023-08-30 23:09:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:09,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:09:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:09,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:09:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:09:09,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:09:09,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 524 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:09,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:09,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:09:09,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:10,168 INFO L130 PetriNetUnfolder]: 5766/9428 cut-off events. [2023-08-30 23:09:10,169 INFO L131 PetriNetUnfolder]: For 14655/14850 co-relation queries the response was YES. [2023-08-30 23:09:10,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32950 conditions, 9428 events. 5766/9428 cut-off events. For 14655/14850 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 65786 event pairs, 1053 based on Foata normal form. 139/9294 useless extension candidates. Maximal degree in co-relation 32922. Up to 3156 conditions per place. [2023-08-30 23:09:10,225 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 93 selfloop transitions, 23 changer transitions 38/168 dead transitions. [2023-08-30 23:09:10,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 168 transitions, 1306 flow [2023-08-30 23:09:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:09:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:09:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2023-08-30 23:09:10,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006915629322268 [2023-08-30 23:09:10,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2023-08-30 23:09:10,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2023-08-30 23:09:10,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:10,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2023-08-30 23:09:10,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:10,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:10,236 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:10,236 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 524 flow. Second operand 9 states and 1086 transitions. [2023-08-30 23:09:10,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 168 transitions, 1306 flow [2023-08-30 23:09:10,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 168 transitions, 1273 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-30 23:09:10,594 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 483 flow [2023-08-30 23:09:10,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2023-08-30 23:09:10,595 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-08-30 23:09:10,595 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 483 flow [2023-08-30 23:09:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:10,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:10,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:10,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:09:10,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:10,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1254467917, now seen corresponding path program 1 times [2023-08-30 23:09:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57735133] [2023-08-30 23:09:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57735133] [2023-08-30 23:09:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57735133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:10,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:10,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355219503] [2023-08-30 23:09:10,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:10,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:10,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:10,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-08-30 23:09:10,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:10,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:10,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-08-30 23:09:10,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:11,699 INFO L130 PetriNetUnfolder]: 4669/7928 cut-off events. [2023-08-30 23:09:11,699 INFO L131 PetriNetUnfolder]: For 19448/19507 co-relation queries the response was YES. [2023-08-30 23:09:11,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31122 conditions, 7928 events. 4669/7928 cut-off events. For 19448/19507 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 53978 event pairs, 1426 based on Foata normal form. 5/7819 useless extension candidates. Maximal degree in co-relation 31097. Up to 3163 conditions per place. [2023-08-30 23:09:11,734 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 65 selfloop transitions, 1 changer transitions 49/127 dead transitions. [2023-08-30 23:09:11,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 127 transitions, 1184 flow [2023-08-30 23:09:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:09:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:09:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-30 23:09:11,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524896265560166 [2023-08-30 23:09:11,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-30 23:09:11,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-30 23:09:11,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:11,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-30 23:09:11,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 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-08-30 23:09:11,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:11,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:11,740 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 483 flow. Second operand 4 states and 506 transitions. [2023-08-30 23:09:11,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 127 transitions, 1184 flow [2023-08-30 23:09:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 987 flow, removed 46 selfloop flow, removed 10 redundant places. [2023-08-30 23:09:11,921 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 357 flow [2023-08-30 23:09:11,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-08-30 23:09:11,922 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-08-30 23:09:11,922 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 357 flow [2023-08-30 23:09:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:11,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:11,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:11,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:09:11,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:11,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1958411517, now seen corresponding path program 2 times [2023-08-30 23:09:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939049168] [2023-08-30 23:09:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939049168] [2023-08-30 23:09:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939049168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:13,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:09:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872018354] [2023-08-30 23:09:13,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:13,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:09:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:09:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:09:13,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 241 [2023-08-30 23:09:13,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:13,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:13,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 241 [2023-08-30 23:09:13,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:14,128 INFO L130 PetriNetUnfolder]: 4091/6607 cut-off events. [2023-08-30 23:09:14,129 INFO L131 PetriNetUnfolder]: For 13106/13106 co-relation queries the response was YES. [2023-08-30 23:09:14,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24225 conditions, 6607 events. 4091/6607 cut-off events. For 13106/13106 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 39517 event pairs, 807 based on Foata normal form. 1/6608 useless extension candidates. Maximal degree in co-relation 24203. Up to 1900 conditions per place. [2023-08-30 23:09:14,158 INFO L137 encePairwiseOnDemand]: 229/241 looper letters, 82 selfloop transitions, 17 changer transitions 83/182 dead transitions. [2023-08-30 23:09:14,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 182 transitions, 1365 flow [2023-08-30 23:09:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:09:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:09:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 939 transitions. [2023-08-30 23:09:14,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870331950207469 [2023-08-30 23:09:14,162 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 939 transitions. [2023-08-30 23:09:14,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 939 transitions. [2023-08-30 23:09:14,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:14,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 939 transitions. [2023-08-30 23:09:14,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.375) internal successors, (939), 8 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:14,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:14,168 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:14,168 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 357 flow. Second operand 8 states and 939 transitions. [2023-08-30 23:09:14,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 182 transitions, 1365 flow [2023-08-30 23:09:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 182 transitions, 1357 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:14,265 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 378 flow [2023-08-30 23:09:14,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2023-08-30 23:09:14,266 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-30 23:09:14,266 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 378 flow [2023-08-30 23:09:14,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:14,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:14,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:14,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:09:14,267 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:14,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 188436783, now seen corresponding path program 3 times [2023-08-30 23:09:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180563064] [2023-08-30 23:09:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:14,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:09:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:14,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:09:14,396 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:09:14,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:09:14,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:09:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:09:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:09:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:09:14,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:09:14,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:09:14,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:09:14,400 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:14,405 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:09:14,406 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:09:14,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:09:14 BasicIcfg [2023-08-30 23:09:14,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:09:14,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:09:14,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:09:14,480 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:09:14,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:46" (3/4) ... [2023-08-30 23:09:14,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:09:14,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:09:14,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:09:14,558 INFO L158 Benchmark]: Toolchain (without parser) took 29372.55ms. Allocated memory was 90.2MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 64.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 23:09:14,559 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:09:14,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.62ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-08-30 23:09:14,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:09:14,559 INFO L158 Benchmark]: Boogie Preprocessor took 32.21ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:09:14,560 INFO L158 Benchmark]: RCFGBuilder took 747.26ms. Allocated memory is still 90.2MB. Free memory was 56.4MB in the beginning and 52.5MB in the end (delta: 3.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-08-30 23:09:14,560 INFO L158 Benchmark]: TraceAbstraction took 27881.00ms. Allocated memory was 90.2MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 52.0MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 23:09:14,560 INFO L158 Benchmark]: Witness Printer took 78.19ms. Allocated memory is still 4.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-30 23:09:14,562 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.18ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.62ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.21ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 747.26ms. Allocated memory is still 90.2MB. Free memory was 56.4MB in the beginning and 52.5MB in the end (delta: 3.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27881.00ms. Allocated memory was 90.2MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 52.0MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 78.19ms. Allocated memory is still 4.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 140 PlacesBefore, 44 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 9486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3311, independent: 3052, independent conditional: 0, independent unconditional: 3052, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1767, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3311, independent: 1341, independent conditional: 0, independent unconditional: 1341, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 1767, unknown conditional: 0, unknown unconditional: 1767] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t353, ((void *)0), P0, ((void *)0))=-2, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=-1, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t356, ((void *)0), P3, ((void *)0))=1, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 171 locations, 7 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: 27.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 139 mSDtfsCounter, 1799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=8, InterpolantAutomatonStates: 66, 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.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:09:14,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE