./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:53:54,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:53:54,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:53:54,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:53:54,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:53:54,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:53:54,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:53:54,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:53:54,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:53:54,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:53:54,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:53:54,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:53:54,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:53:54,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:53:54,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:53:54,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:53:54,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:53:54,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:53:54,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:53:54,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:53:54,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:53:54,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:53:54,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:53:54,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:53:54,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:53:54,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:53:54,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:53:54,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:53:54,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:53:54,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:53:54,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:53:54,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:53:54,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:53:54,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:53:54,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:53:54,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:53:54,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:53:54,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:53:54,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:53:54,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:53:54,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:53:54,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:53:54,381 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:53:54,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:53:54,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:53:54,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:53:54,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:53:54,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:53:54,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:53:54,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:53:54,386 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:53:54,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:53:54,386 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:53:54,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:53:54,388 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:53:54,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:53:54,388 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:53:54,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:53:54,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:53:54,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:53:54,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:53:54,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:54,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:53:54,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:53:54,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:53:54,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:53:54,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:53:54,390 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:53:54,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:53:54,391 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:53:54,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:53:54,391 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:53:54,391 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:53:54,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:53:54,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:53:54,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:53:54,708 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:53:54,709 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:53:54,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:55,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:53:56,076 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:53:56,081 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:56,101 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4bc188f/d78892f2ab30491fb5a281c15d077e5d/FLAGb4bc5b286 [2023-09-01 09:53:56,127 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4bc188f/d78892f2ab30491fb5a281c15d077e5d [2023-09-01 09:53:56,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:53:56,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:53:56,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:56,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:53:56,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:53:56,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbbebdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56, skipping insertion in model container [2023-09-01 09:53:56,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:53:56,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:53:56,368 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-09-01 09:53:56,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:56,578 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:53:56,587 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-09-01 09:53:56,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:56,699 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:56,700 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:56,705 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:53:56,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56 WrapperNode [2023-09-01 09:53:56,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:56,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:56,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:53:56,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:53:56,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,757 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-09-01 09:53:56,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:56,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:53:56,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:53:56,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:53:56,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,786 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:53:56,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:53:56,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:53:56,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:53:56,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (1/1) ... [2023-09-01 09:53:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:56,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:53:56,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:53:56,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:53:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:53:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:53:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:53:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:53:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:53:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:53:56,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:53:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:53:56,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:53:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:53:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:53:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:53:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:53:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:53:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:53:56,877 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:53:57,005 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:53:57,007 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:53:57,462 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:53:57,604 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:53:57,605 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:53:57,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:57 BoogieIcfgContainer [2023-09-01 09:53:57,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:53:57,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:53:57,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:53:57,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:53:57,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:53:56" (1/3) ... [2023-09-01 09:53:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bef83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:57, skipping insertion in model container [2023-09-01 09:53:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:56" (2/3) ... [2023-09-01 09:53:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62bef83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:57, skipping insertion in model container [2023-09-01 09:53:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:57" (3/3) ... [2023-09-01 09:53:57,614 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:53:57,621 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:53:57,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:53:57,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:53:57,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:53:57,703 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:53:57,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-09-01 09:53:57,803 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-09-01 09:53:57,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-09-01 09:53:57,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-09-01 09:53:57,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-09-01 09:53:57,816 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:53:57,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-09-01 09:53:57,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-09-01 09:53:57,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-09-01 09:53:57,871 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-09-01 09:53:57,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:57,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-09-01 09:53:57,874 INFO L119 LiptonReduction]: Number of co-enabled transitions 1800 [2023-09-01 09:54:01,390 INFO L134 LiptonReduction]: Checked pairs total: 4706 [2023-09-01 09:54:01,390 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-09-01 09:54:01,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:54:01,407 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;@7c5bd40a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:54:01,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:54:01,411 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-09-01 09:54:01,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:54:01,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:01,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:54:01,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:01,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 478086440, now seen corresponding path program 1 times [2023-09-01 09:54:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961617545] [2023-09-01 09:54:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961617545] [2023-09-01 09:54:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961617545] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:54:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107260632] [2023-09-01 09:54:01,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:01,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:54:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:54:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:54:01,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-09-01 09:54:01,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:01,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:01,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-09-01 09:54:01,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:02,227 INFO L130 PetriNetUnfolder]: 909/1446 cut-off events. [2023-09-01 09:54:02,227 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 09:54:02,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1446 events. 909/1446 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6812 event pairs, 117 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2848. Up to 1145 conditions per place. [2023-09-01 09:54:02,243 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 28 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-09-01 09:54:02,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 142 flow [2023-09-01 09:54:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:54:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:54:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-09-01 09:54:02,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179738562091504 [2023-09-01 09:54:02,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-09-01 09:54:02,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-09-01 09:54:02,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:02,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-09-01 09:54:02,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,274 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 317 transitions. [2023-09-01 09:54:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 142 flow [2023-09-01 09:54:02,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:54:02,279 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-09-01 09:54:02,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-09-01 09:54:02,283 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-09-01 09:54:02,283 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-09-01 09:54:02,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:02,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:02,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:54:02,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:02,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 284150693, now seen corresponding path program 1 times [2023-09-01 09:54:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695406191] [2023-09-01 09:54:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695406191] [2023-09-01 09:54:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695406191] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:54:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858247902] [2023-09-01 09:54:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:02,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:54:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:54:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:54:02,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:02,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:02,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:02,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:02,776 INFO L130 PetriNetUnfolder]: 861/1294 cut-off events. [2023-09-01 09:54:02,776 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-09-01 09:54:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1294 events. 861/1294 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5307 event pairs, 245 based on Foata normal form. 8/1302 useless extension candidates. Maximal degree in co-relation 2708. Up to 1239 conditions per place. [2023-09-01 09:54:02,783 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-09-01 09:54:02,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 144 flow [2023-09-01 09:54:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:54:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:54:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-09-01 09:54:02,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-09-01 09:54:02,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-09-01 09:54:02,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-09-01 09:54:02,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:02,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-09-01 09:54:02,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,795 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 300 transitions. [2023-09-01 09:54:02,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 144 flow [2023-09-01 09:54:02,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:54:02,796 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2023-09-01 09:54:02,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-09-01 09:54:02,797 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-09-01 09:54:02,797 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2023-09-01 09:54:02,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:02,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:02,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:54:02,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:02,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 218735648, now seen corresponding path program 1 times [2023-09-01 09:54:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335816613] [2023-09-01 09:54:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:03,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335816613] [2023-09-01 09:54:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335816613] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:54:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516378155] [2023-09-01 09:54:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:03,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:03,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-09-01 09:54:03,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:03,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-09-01 09:54:03,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:03,317 INFO L130 PetriNetUnfolder]: 1039/1560 cut-off events. [2023-09-01 09:54:03,317 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2023-09-01 09:54:03,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 1560 events. 1039/1560 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6533 event pairs, 75 based on Foata normal form. 24/1584 useless extension candidates. Maximal degree in co-relation 3488. Up to 977 conditions per place. [2023-09-01 09:54:03,326 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 45 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2023-09-01 09:54:03,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 273 flow [2023-09-01 09:54:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:54:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:54:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-09-01 09:54:03,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-09-01 09:54:03,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-09-01 09:54:03,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-09-01 09:54:03,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:03,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-09-01 09:54:03,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 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-09-01 09:54:03,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,333 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 5 states and 493 transitions. [2023-09-01 09:54:03,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 273 flow [2023-09-01 09:54:03,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:54:03,336 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 157 flow [2023-09-01 09:54:03,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-09-01 09:54:03,337 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-09-01 09:54:03,340 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 157 flow [2023-09-01 09:54:03,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:03,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:54:03,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:03,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1602203946, now seen corresponding path program 1 times [2023-09-01 09:54:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207859873] [2023-09-01 09:54:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:03,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207859873] [2023-09-01 09:54:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207859873] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:03,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:03,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:54:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574937903] [2023-09-01 09:54:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:03,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:54:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:03,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:54:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:54:03,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-09-01 09:54:03,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:03,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-09-01 09:54:03,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:03,938 INFO L130 PetriNetUnfolder]: 1191/1808 cut-off events. [2023-09-01 09:54:03,939 INFO L131 PetriNetUnfolder]: For 1799/1799 co-relation queries the response was YES. [2023-09-01 09:54:03,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 1808 events. 1191/1808 cut-off events. For 1799/1799 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7747 event pairs, 195 based on Foata normal form. 80/1888 useless extension candidates. Maximal degree in co-relation 5132. Up to 771 conditions per place. [2023-09-01 09:54:03,946 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 33 selfloop transitions, 5 changer transitions 14/52 dead transitions. [2023-09-01 09:54:03,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 329 flow [2023-09-01 09:54:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:54:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:54:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-09-01 09:54:03,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-09-01 09:54:03,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-09-01 09:54:03,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-09-01 09:54:03,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:03,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-09-01 09:54:03,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,953 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 157 flow. Second operand 4 states and 391 transitions. [2023-09-01 09:54:03,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 329 flow [2023-09-01 09:54:03,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:54:03,956 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 123 flow [2023-09-01 09:54:03,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-09-01 09:54:03,957 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-09-01 09:54:03,957 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 123 flow [2023-09-01 09:54:03,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:03,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:03,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:03,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:54:03,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:03,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1809129786, now seen corresponding path program 1 times [2023-09-01 09:54:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541828914] [2023-09-01 09:54:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541828914] [2023-09-01 09:54:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541828914] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:54:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351539618] [2023-09-01 09:54:04,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:04,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:04,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:04,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:04,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:04,266 INFO L130 PetriNetUnfolder]: 527/812 cut-off events. [2023-09-01 09:54:04,267 INFO L131 PetriNetUnfolder]: For 1393/1393 co-relation queries the response was YES. [2023-09-01 09:54:04,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 812 events. 527/812 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2917 event pairs, 379 based on Foata normal form. 18/830 useless extension candidates. Maximal degree in co-relation 2436. Up to 604 conditions per place. [2023-09-01 09:54:04,272 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-09-01 09:54:04,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 209 flow [2023-09-01 09:54:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:54:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:54:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-09-01 09:54:04,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869281045751634 [2023-09-01 09:54:04,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-09-01 09:54:04,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-09-01 09:54:04,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:04,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-09-01 09:54:04,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,277 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 123 flow. Second operand 3 states and 298 transitions. [2023-09-01 09:54:04,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 209 flow [2023-09-01 09:54:04,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 192 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-09-01 09:54:04,282 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 120 flow [2023-09-01 09:54:04,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-09-01 09:54:04,284 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-09-01 09:54:04,285 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 120 flow [2023-09-01 09:54:04,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:04,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:54:04,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:04,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1252845286, now seen corresponding path program 1 times [2023-09-01 09:54:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659785904] [2023-09-01 09:54:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659785904] [2023-09-01 09:54:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659785904] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:54:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117872786] [2023-09-01 09:54:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:04,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:04,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:04,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:04,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:04,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:04,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:04,729 INFO L130 PetriNetUnfolder]: 369/624 cut-off events. [2023-09-01 09:54:04,730 INFO L131 PetriNetUnfolder]: For 842/868 co-relation queries the response was YES. [2023-09-01 09:54:04,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 624 events. 369/624 cut-off events. For 842/868 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2652 event pairs, 84 based on Foata normal form. 67/677 useless extension candidates. Maximal degree in co-relation 1867. Up to 268 conditions per place. [2023-09-01 09:54:04,734 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 44 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-09-01 09:54:04,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 336 flow [2023-09-01 09:54:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:54:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:54:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-09-01 09:54:04,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-09-01 09:54:04,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-09-01 09:54:04,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-09-01 09:54:04,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:04,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-09-01 09:54:04,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,740 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 120 flow. Second operand 4 states and 400 transitions. [2023-09-01 09:54:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 336 flow [2023-09-01 09:54:04,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:54:04,742 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 146 flow [2023-09-01 09:54:04,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-09-01 09:54:04,743 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-09-01 09:54:04,743 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 146 flow [2023-09-01 09:54:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:04,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:04,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:04,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:54:04,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:04,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1274799269, now seen corresponding path program 1 times [2023-09-01 09:54:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306995665] [2023-09-01 09:54:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306995665] [2023-09-01 09:54:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306995665] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:54:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853502730] [2023-09-01 09:54:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:05,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:54:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:54:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:54:05,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:05,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:05,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:05,240 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2023-09-01 09:54:05,241 INFO L131 PetriNetUnfolder]: For 422/432 co-relation queries the response was YES. [2023-09-01 09:54:05,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 326 events. 173/326 cut-off events. For 422/432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1230 event pairs, 30 based on Foata normal form. 39/359 useless extension candidates. Maximal degree in co-relation 1148. Up to 133 conditions per place. [2023-09-01 09:54:05,243 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 47 selfloop transitions, 8 changer transitions 1/57 dead transitions. [2023-09-01 09:54:05,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 389 flow [2023-09-01 09:54:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:54:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:54:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-09-01 09:54:05,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872549019607843 [2023-09-01 09:54:05,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-09-01 09:54:05,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-09-01 09:54:05,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:05,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-09-01 09:54:05,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,250 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 146 flow. Second operand 5 states and 497 transitions. [2023-09-01 09:54:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 389 flow [2023-09-01 09:54:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 373 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 09:54:05,253 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 181 flow [2023-09-01 09:54:05,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-09-01 09:54:05,254 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-09-01 09:54:05,254 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 181 flow [2023-09-01 09:54:05,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:05,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:05,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:54:05,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:05,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1131012184, now seen corresponding path program 1 times [2023-09-01 09:54:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253364814] [2023-09-01 09:54:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:05,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253364814] [2023-09-01 09:54:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253364814] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:54:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506378227] [2023-09-01 09:54:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:05,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:05,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-09-01 09:54:05,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:05,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-09-01 09:54:05,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:05,646 INFO L130 PetriNetUnfolder]: 185/363 cut-off events. [2023-09-01 09:54:05,646 INFO L131 PetriNetUnfolder]: For 745/745 co-relation queries the response was YES. [2023-09-01 09:54:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 363 events. 185/363 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 51 based on Foata normal form. 7/370 useless extension candidates. Maximal degree in co-relation 1410. Up to 210 conditions per place. [2023-09-01 09:54:05,648 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 33 selfloop transitions, 3 changer transitions 13/49 dead transitions. [2023-09-01 09:54:05,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 392 flow [2023-09-01 09:54:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:54:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:54:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2023-09-01 09:54:05,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889705882352941 [2023-09-01 09:54:05,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2023-09-01 09:54:05,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2023-09-01 09:54:05,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:05,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2023-09-01 09:54:05,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 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-09-01 09:54:05,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,653 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 181 flow. Second operand 4 states and 399 transitions. [2023-09-01 09:54:05,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 392 flow [2023-09-01 09:54:05,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 345 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-09-01 09:54:05,657 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 177 flow [2023-09-01 09:54:05,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=157, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-09-01 09:54:05,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-09-01 09:54:05,658 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 177 flow [2023-09-01 09:54:05,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:05,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:05,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:05,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:54:05,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:05,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1081410734, now seen corresponding path program 1 times [2023-09-01 09:54:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480726616] [2023-09-01 09:54:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480726616] [2023-09-01 09:54:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480726616] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:06,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:54:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364358271] [2023-09-01 09:54:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:06,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:54:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:54:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:54:06,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:06,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:06,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:06,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:06,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:06,179 INFO L130 PetriNetUnfolder]: 145/290 cut-off events. [2023-09-01 09:54:06,179 INFO L131 PetriNetUnfolder]: For 337/344 co-relation queries the response was YES. [2023-09-01 09:54:06,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 290 events. 145/290 cut-off events. For 337/344 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1128 event pairs, 37 based on Foata normal form. 19/304 useless extension candidates. Maximal degree in co-relation 979. Up to 102 conditions per place. [2023-09-01 09:54:06,181 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 25 selfloop transitions, 11 changer transitions 12/49 dead transitions. [2023-09-01 09:54:06,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 350 flow [2023-09-01 09:54:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:54:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:54:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 577 transitions. [2023-09-01 09:54:06,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714052287581699 [2023-09-01 09:54:06,184 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 577 transitions. [2023-09-01 09:54:06,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 577 transitions. [2023-09-01 09:54:06,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:06,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 577 transitions. [2023-09-01 09:54:06,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:06,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:06,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:06,188 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 177 flow. Second operand 6 states and 577 transitions. [2023-09-01 09:54:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 350 flow [2023-09-01 09:54:06,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 322 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-09-01 09:54:06,191 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 156 flow [2023-09-01 09:54:06,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2023-09-01 09:54:06,191 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-09-01 09:54:06,192 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 156 flow [2023-09-01 09:54:06,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:06,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:06,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:06,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:54:06,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:06,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1624150509, now seen corresponding path program 1 times [2023-09-01 09:54:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818914537] [2023-09-01 09:54:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818914537] [2023-09-01 09:54:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818914537] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:07,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:07,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:54:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960102790] [2023-09-01 09:54:07,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:07,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:54:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:54:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:54:07,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-09-01 09:54:07,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:07,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:07,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-09-01 09:54:07,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:08,013 INFO L130 PetriNetUnfolder]: 64/150 cut-off events. [2023-09-01 09:54:08,013 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-09-01 09:54:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 150 events. 64/150 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 489 event pairs, 10 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 563. Up to 65 conditions per place. [2023-09-01 09:54:08,014 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 29 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-09-01 09:54:08,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 418 flow [2023-09-01 09:54:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:54:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:54:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 750 transitions. [2023-09-01 09:54:08,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2023-09-01 09:54:08,017 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 750 transitions. [2023-09-01 09:54:08,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 750 transitions. [2023-09-01 09:54:08,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:08,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 750 transitions. [2023-09-01 09:54:08,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.75) internal successors, (750), 8 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:08,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:08,023 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:08,023 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 156 flow. Second operand 8 states and 750 transitions. [2023-09-01 09:54:08,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 418 flow [2023-09-01 09:54:08,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 273 flow, removed 28 selfloop flow, removed 12 redundant places. [2023-09-01 09:54:08,025 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 102 flow [2023-09-01 09:54:08,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-09-01 09:54:08,026 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-09-01 09:54:08,026 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 102 flow [2023-09-01 09:54:08,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:08,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:08,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:08,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:54:08,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:08,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1566932833, now seen corresponding path program 2 times [2023-09-01 09:54:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252870205] [2023-09-01 09:54:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:54:08,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:54:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:54:08,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:54:08,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:54:08,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:54:08,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:54:08,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:54:08,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:54:08,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:54:08,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:54:08,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:54:08,163 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:08,168 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:54:08,168 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:54:08,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:54:08 BasicIcfg [2023-09-01 09:54:08,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:54:08,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:54:08,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:54:08,237 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:54:08,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:57" (3/4) ... [2023-09-01 09:54:08,239 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:54:08,294 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:54:08,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:54:08,295 INFO L158 Benchmark]: Toolchain (without parser) took 12164.87ms. Allocated memory was 77.6MB in the beginning and 251.7MB in the end (delta: 174.1MB). Free memory was 53.9MB in the beginning and 100.9MB in the end (delta: -47.0MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,295 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:54:08,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.05ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 49.5MB in the end (delta: 4.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,296 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,297 INFO L158 Benchmark]: RCFGBuilder took 814.78ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 46.0MB in the end (delta: -1.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,297 INFO L158 Benchmark]: TraceAbstraction took 10627.45ms. Allocated memory was 94.4MB in the beginning and 251.7MB in the end (delta: 157.3MB). Free memory was 45.1MB in the beginning and 111.4MB in the end (delta: -66.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,297 INFO L158 Benchmark]: Witness Printer took 57.90ms. Allocated memory is still 251.7MB. Free memory was 111.4MB in the beginning and 100.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 09:54:08,299 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 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.05ms. Allocated memory is still 77.6MB. Free memory was 53.6MB in the beginning and 49.5MB in the end (delta: 4.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.78ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 46.0MB in the end (delta: -1.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10627.45ms. Allocated memory was 94.4MB in the beginning and 251.7MB in the end (delta: 157.3MB). Free memory was 45.1MB in the beginning and 111.4MB in the end (delta: -66.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * Witness Printer took 57.90ms. Allocated memory is still 251.7MB. Free memory was 111.4MB in the beginning and 100.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 113 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 4706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2318, independent: 2149, independent conditional: 0, independent unconditional: 2149, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 971, independent conditional: 0, independent unconditional: 971, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2318, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1005, unknown conditional: 0, unknown unconditional: 1005] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-3, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-2, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 820 IncrementalHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 29 mSDtfsCounter, 820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:54:08,324 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