/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:11:58,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:11:58,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:11:58,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:11:58,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:11:58,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:11:58,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:11:58,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:11:58,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:11:58,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:11:58,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:11:58,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:11:58,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:11:58,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:11:58,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:11:58,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:11:58,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:11:58,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:11:58,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:11:58,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:11:58,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:11:58,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:11:58,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:11:58,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:11:58,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:11:58,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:11:58,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:11:58,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:11:58,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:11:58,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:11:58,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:11:58,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:11:58,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:11:58,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:11:58,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:11:58,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:11:58,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:11:58,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:11:58,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:11:58,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:11:58,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:11:58,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:11:59,018 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:11:59,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:11:59,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:11:59,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:11:59,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:11:59,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:11:59,020 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:11:59,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:11:59,020 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:11:59,021 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:11:59,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:11:59,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:11:59,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:11:59,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:11:59,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:11:59,024 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:11:59,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:11:59,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:11:59,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:11:59,223 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:11:59,223 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:11:59,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:00,470 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:12:00,702 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:12:00,702 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:00,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2285aa7f3/144ff4e518b3470c97b0bf7f0ae16fbd/FLAG0590fbe6c [2023-01-27 18:12:00,729 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2285aa7f3/144ff4e518b3470c97b0bf7f0ae16fbd [2023-01-27 18:12:00,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:12:00,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:12:00,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:12:00,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:12:00,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:12:00,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:12:00" (1/1) ... [2023-01-27 18:12:00,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae8f93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:00, skipping insertion in model container [2023-01-27 18:12:00,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:12:00" (1/1) ... [2023-01-27 18:12:00,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:12:00,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:12:00,893 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:12:01,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:12:01,089 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:12:01,102 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:12:01,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:12:01,192 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:12:01,192 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:12:01,198 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:12:01,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01 WrapperNode [2023-01-27 18:12:01,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:12:01,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:12:01,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:12:01,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:12:01,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,252 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-01-27 18:12:01,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:12:01,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:12:01,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:12:01,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:12:01,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,275 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:12:01,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:12:01,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:12:01,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:12:01,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (1/1) ... [2023-01-27 18:12:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:12:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:12:01,334 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-01-27 18:12:01,341 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-01-27 18:12:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:12:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:12:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:12:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:12:01,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:12:01,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:12:01,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:12:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:12:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:12:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:12:01,363 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:12:01,483 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:12:01,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:12:01,823 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:12:01,917 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:12:01,918 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:12:01,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:12:01 BoogieIcfgContainer [2023-01-27 18:12:01,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:12:01,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:12:01,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:12:01,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:12:01,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:12:00" (1/3) ... [2023-01-27 18:12:01,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba271a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:12:01, skipping insertion in model container [2023-01-27 18:12:01,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:12:01" (2/3) ... [2023-01-27 18:12:01,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ba271a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:12:01, skipping insertion in model container [2023-01-27 18:12:01,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:12:01" (3/3) ... [2023-01-27 18:12:01,926 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:12:01,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:12:01,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:12:01,941 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:12:01,992 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:12:02,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:12:02,053 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:12:02,054 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:02,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:12:02,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:12:02,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-01-27 18:12:02,065 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:12:02,072 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:12:02,075 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:12:02,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-01-27 18:12:02,098 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:12:02,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:02,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:12:02,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-01-27 18:12:05,357 INFO L134 LiptonReduction]: Checked pairs total: 5396 [2023-01-27 18:12:05,357 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-27 18:12:05,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:12:05,375 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=false, 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;@6f372d0f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:12:05,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:12:05,378 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:12:05,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:12:05,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:05,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:12:05,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:05,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 484427, now seen corresponding path program 1 times [2023-01-27 18:12:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9292606] [2023-01-27 18:12:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9292606] [2023-01-27 18:12:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9292606] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:12:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560133479] [2023-01-27 18:12:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:05,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:05,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209 [2023-01-27 18:12:05,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-01-27 18:12:05,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:05,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209 [2023-01-27 18:12:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:06,207 INFO L130 PetriNetUnfolder]: 1079/1667 cut-off events. [2023-01-27 18:12:06,208 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-27 18:12:06,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1667 events. 1079/1667 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7952 event pairs, 301 based on Foata normal form. 0/1570 useless extension candidates. Maximal degree in co-relation 3303. Up to 1297 conditions per place. [2023-01-27 18:12:06,223 INFO L137 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-01-27 18:12:06,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-01-27 18:12:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-01-27 18:12:06,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532695374800638 [2023-01-27 18:12:06,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-01-27 18:12:06,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-01-27 18:12:06,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:06,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-01-27 18:12:06,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-01-27 18:12:06,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:06,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:06,263 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 334 transitions. [2023-01-27 18:12:06,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-01-27 18:12:06,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:12:06,267 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-27 18:12:06,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-27 18:12:06,272 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:12:06,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-27 18:12:06,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-01-27 18:12:06,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:06,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:06,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:12:06,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:06,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 353077464, now seen corresponding path program 1 times [2023-01-27 18:12:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767632841] [2023-01-27 18:12:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767632841] [2023-01-27 18:12:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767632841] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:12:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913975285] [2023-01-27 18:12:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:06,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:06,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-01-27 18:12:06,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:06,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:06,992 INFO L130 PetriNetUnfolder]: 2001/3012 cut-off events. [2023-01-27 18:12:06,993 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2023-01-27 18:12:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 3012 events. 2001/3012 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14400 event pairs, 651 based on Foata normal form. 94/3106 useless extension candidates. Maximal degree in co-relation 6234. Up to 2040 conditions per place. [2023-01-27 18:12:07,007 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-01-27 18:12:07,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 170 flow [2023-01-27 18:12:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-01-27 18:12:07,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944178628389155 [2023-01-27 18:12:07,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-01-27 18:12:07,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-01-27 18:12:07,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:07,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-01-27 18:12:07,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-01-27 18:12:07,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:07,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:07,015 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 310 transitions. [2023-01-27 18:12:07,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 170 flow [2023-01-27 18:12:07,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:07,016 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2023-01-27 18:12:07,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-01-27 18:12:07,017 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-01-27 18:12:07,017 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2023-01-27 18:12:07,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-01-27 18:12:07,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:07,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:07,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:12:07,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:07,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1939501328, now seen corresponding path program 1 times [2023-01-27 18:12:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:07,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341945576] [2023-01-27 18:12:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341945576] [2023-01-27 18:12:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341945576] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:07,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:07,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:12:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53264304] [2023-01-27 18:12:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:07,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:07,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:07,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:07,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:07,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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-01-27 18:12:07,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:07,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:07,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:07,604 INFO L130 PetriNetUnfolder]: 1865/2812 cut-off events. [2023-01-27 18:12:07,604 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-01-27 18:12:07,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2812 events. 1865/2812 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12789 event pairs, 553 based on Foata normal form. 40/2852 useless extension candidates. Maximal degree in co-relation 6940. Up to 1428 conditions per place. [2023-01-27 18:12:07,618 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-01-27 18:12:07,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 240 flow [2023-01-27 18:12:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:12:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:12:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-01-27 18:12:07,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-01-27 18:12:07,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-01-27 18:12:07,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-01-27 18:12:07,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:07,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-01-27 18:12:07,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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-01-27 18:12:07,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:07,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:07,624 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 404 transitions. [2023-01-27 18:12:07,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 240 flow [2023-01-27 18:12:07,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:07,632 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2023-01-27 18:12:07,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-27 18:12:07,633 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-01-27 18:12:07,636 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2023-01-27 18:12:07,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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-01-27 18:12:07,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:07,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:12:07,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:07,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -34018649, now seen corresponding path program 1 times [2023-01-27 18:12:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385931068] [2023-01-27 18:12:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385931068] [2023-01-27 18:12:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385931068] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:12:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122315151] [2023-01-27 18:12:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:07,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:07,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:07,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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-01-27 18:12:07,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:07,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:07,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:08,141 INFO L130 PetriNetUnfolder]: 1826/2753 cut-off events. [2023-01-27 18:12:08,141 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2023-01-27 18:12:08,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2753 events. 1826/2753 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13032 event pairs, 350 based on Foata normal form. 8/2761 useless extension candidates. Maximal degree in co-relation 7246. Up to 1795 conditions per place. [2023-01-27 18:12:08,157 INFO L137 encePairwiseOnDemand]: 202/209 looper letters, 43 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2023-01-27 18:12:08,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 322 flow [2023-01-27 18:12:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:12:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:12:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-01-27 18:12:08,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49282296650717705 [2023-01-27 18:12:08,160 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-01-27 18:12:08,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-01-27 18:12:08,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:08,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-01-27 18:12:08,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-01-27 18:12:08,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:08,163 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:08,164 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 4 states and 412 transitions. [2023-01-27 18:12:08,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 322 flow [2023-01-27 18:12:08,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:12:08,169 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 201 flow [2023-01-27 18:12:08,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-27 18:12:08,170 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-27 18:12:08,171 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 201 flow [2023-01-27 18:12:08,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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-01-27 18:12:08,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:08,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:12:08,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:08,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1054541743, now seen corresponding path program 1 times [2023-01-27 18:12:08,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110257399] [2023-01-27 18:12:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110257399] [2023-01-27 18:12:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110257399] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:08,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:12:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393680785] [2023-01-27 18:12:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:08,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:08,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:12:08,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:08,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:08,675 INFO L130 PetriNetUnfolder]: 1129/1884 cut-off events. [2023-01-27 18:12:08,675 INFO L131 PetriNetUnfolder]: For 1904/1987 co-relation queries the response was YES. [2023-01-27 18:12:08,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 1884 events. 1129/1884 cut-off events. For 1904/1987 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10100 event pairs, 195 based on Foata normal form. 222/2071 useless extension candidates. Maximal degree in co-relation 5243. Up to 1041 conditions per place. [2023-01-27 18:12:08,687 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 71 selfloop transitions, 7 changer transitions 4/89 dead transitions. [2023-01-27 18:12:08,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 89 transitions, 640 flow [2023-01-27 18:12:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:12:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:12:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-27 18:12:08,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2023-01-27 18:12:08,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-27 18:12:08,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-27 18:12:08,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:08,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-27 18:12:08,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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-01-27 18:12:08,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-27 18:12:08,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-27 18:12:08,694 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 201 flow. Second operand 5 states and 510 transitions. [2023-01-27 18:12:08,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 89 transitions, 640 flow [2023-01-27 18:12:08,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 89 transitions, 636 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-27 18:12:08,699 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 253 flow [2023-01-27 18:12:08,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-01-27 18:12:08,700 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:12:08,700 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 253 flow [2023-01-27 18:12:08,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:12:08,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:08,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:08,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:12:08,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:08,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash -423934774, now seen corresponding path program 1 times [2023-01-27 18:12:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958719512] [2023-01-27 18:12:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958719512] [2023-01-27 18:12:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958719512] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:12:08,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402998005] [2023-01-27 18:12:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:08,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:12:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:12:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:12:08,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209 [2023-01-27 18:12:08,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 253 flow. Second operand has 3 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-01-27 18:12:08,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:08,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209 [2023-01-27 18:12:08,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:09,233 INFO L130 PetriNetUnfolder]: 1474/2492 cut-off events. [2023-01-27 18:12:09,234 INFO L131 PetriNetUnfolder]: For 4024/4028 co-relation queries the response was YES. [2023-01-27 18:12:09,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8693 conditions, 2492 events. 1474/2492 cut-off events. For 4024/4028 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13877 event pairs, 641 based on Foata normal form. 40/2500 useless extension candidates. Maximal degree in co-relation 8670. Up to 1346 conditions per place. [2023-01-27 18:12:09,248 INFO L137 encePairwiseOnDemand]: 206/209 looper letters, 44 selfloop transitions, 6 changer transitions 9/61 dead transitions. [2023-01-27 18:12:09,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 461 flow [2023-01-27 18:12:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:12:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:12:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-01-27 18:12:09,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-01-27 18:12:09,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-01-27 18:12:09,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-01-27 18:12:09,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:09,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-01-27 18:12:09,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-01-27 18:12:09,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:09,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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-01-27 18:12:09,253 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 253 flow. Second operand 3 states and 323 transitions. [2023-01-27 18:12:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 461 flow [2023-01-27 18:12:09,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:12:09,262 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 239 flow [2023-01-27 18:12:09,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-01-27 18:12:09,263 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-27 18:12:09,263 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 239 flow [2023-01-27 18:12:09,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-01-27 18:12:09,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:09,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:09,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:12:09,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:09,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 284755410, now seen corresponding path program 1 times [2023-01-27 18:12:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775053767] [2023-01-27 18:12:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775053767] [2023-01-27 18:12:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775053767] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:12:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716836052] [2023-01-27 18:12:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:09,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:12:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:12:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:12:09,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-01-27 18:12:09,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 239 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:12:09,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:09,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-01-27 18:12:09,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:09,830 INFO L130 PetriNetUnfolder]: 1653/2781 cut-off events. [2023-01-27 18:12:09,830 INFO L131 PetriNetUnfolder]: For 4674/4706 co-relation queries the response was YES. [2023-01-27 18:12:09,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9495 conditions, 2781 events. 1653/2781 cut-off events. For 4674/4706 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15929 event pairs, 328 based on Foata normal form. 52/2809 useless extension candidates. Maximal degree in co-relation 9471. Up to 1442 conditions per place. [2023-01-27 18:12:09,844 INFO L137 encePairwiseOnDemand]: 206/209 looper letters, 49 selfloop transitions, 3 changer transitions 10/65 dead transitions. [2023-01-27 18:12:09,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 504 flow [2023-01-27 18:12:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:12:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:12:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-01-27 18:12:09,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 18:12:09,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-01-27 18:12:09,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-01-27 18:12:09,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:09,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-01-27 18:12:09,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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-01-27 18:12:09,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:09,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-27 18:12:09,850 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 239 flow. Second operand 4 states and 418 transitions. [2023-01-27 18:12:09,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 504 flow [2023-01-27 18:12:09,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 478 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-27 18:12:09,865 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 233 flow [2023-01-27 18:12:09,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-01-27 18:12:09,866 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-27 18:12:09,866 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 233 flow [2023-01-27 18:12:09,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:12:09,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:09,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:12:09,867 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:09,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 705338604, now seen corresponding path program 2 times [2023-01-27 18:12:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739791947] [2023-01-27 18:12:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739791947] [2023-01-27 18:12:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739791947] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:12:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885980673] [2023-01-27 18:12:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:10,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:12:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:12:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:12:10,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:10,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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-01-27 18:12:10,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:10,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:10,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:10,339 INFO L130 PetriNetUnfolder]: 861/1614 cut-off events. [2023-01-27 18:12:10,339 INFO L131 PetriNetUnfolder]: For 1479/1503 co-relation queries the response was YES. [2023-01-27 18:12:10,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5221 conditions, 1614 events. 861/1614 cut-off events. For 1479/1503 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9479 event pairs, 166 based on Foata normal form. 214/1810 useless extension candidates. Maximal degree in co-relation 5197. Up to 652 conditions per place. [2023-01-27 18:12:10,353 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 52 selfloop transitions, 7 changer transitions 34/98 dead transitions. [2023-01-27 18:12:10,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 751 flow [2023-01-27 18:12:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:12:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:12:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2023-01-27 18:12:10,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48883572567783096 [2023-01-27 18:12:10,356 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2023-01-27 18:12:10,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2023-01-27 18:12:10,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:10,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2023-01-27 18:12:10,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 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-01-27 18:12:10,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-27 18:12:10,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-27 18:12:10,391 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 233 flow. Second operand 6 states and 613 transitions. [2023-01-27 18:12:10,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 751 flow [2023-01-27 18:12:10,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 737 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:12:10,395 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 261 flow [2023-01-27 18:12:10,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-01-27 18:12:10,399 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-01-27 18:12:10,399 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 261 flow [2023-01-27 18:12:10,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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-01-27 18:12:10,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:10,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:10,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:12:10,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:10,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1482863659, now seen corresponding path program 1 times [2023-01-27 18:12:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882331024] [2023-01-27 18:12:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:10,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882331024] [2023-01-27 18:12:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882331024] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:10,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:10,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:12:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440043481] [2023-01-27 18:12:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:12:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:12:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:12:10,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 209 [2023-01-27 18:12:10,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-01-27 18:12:10,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:10,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 209 [2023-01-27 18:12:10,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:10,962 INFO L130 PetriNetUnfolder]: 500/980 cut-off events. [2023-01-27 18:12:10,963 INFO L131 PetriNetUnfolder]: For 1757/1778 co-relation queries the response was YES. [2023-01-27 18:12:10,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 980 events. 500/980 cut-off events. For 1757/1778 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5319 event pairs, 152 based on Foata normal form. 63/1030 useless extension candidates. Maximal degree in co-relation 3597. Up to 358 conditions per place. [2023-01-27 18:12:10,968 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 35 selfloop transitions, 10 changer transitions 32/79 dead transitions. [2023-01-27 18:12:10,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 633 flow [2023-01-27 18:12:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:12:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:12:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-01-27 18:12:10,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730006835269993 [2023-01-27 18:12:10,971 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-01-27 18:12:10,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-01-27 18:12:10,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:10,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-01-27 18:12:10,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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-01-27 18:12:10,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-27 18:12:10,975 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-27 18:12:10,975 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 261 flow. Second operand 7 states and 692 transitions. [2023-01-27 18:12:10,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 633 flow [2023-01-27 18:12:10,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 587 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-01-27 18:12:10,999 INFO L231 Difference]: Finished difference. Result has 58 places, 28 transitions, 176 flow [2023-01-27 18:12:10,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=28} [2023-01-27 18:12:10,999 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-01-27 18:12:11,000 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 28 transitions, 176 flow [2023-01-27 18:12:11,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-01-27 18:12:11,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:11,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:11,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:12:11,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:11,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash 476654974, now seen corresponding path program 1 times [2023-01-27 18:12:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096382155] [2023-01-27 18:12:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:12:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:12:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:12:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096382155] [2023-01-27 18:12:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096382155] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:12:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:12:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:12:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429489999] [2023-01-27 18:12:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:12:11,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:12:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:12:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:12:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:12:11,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 209 [2023-01-27 18:12:11,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 28 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-01-27 18:12:11,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:12:11,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 209 [2023-01-27 18:12:11,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:12:12,182 INFO L130 PetriNetUnfolder]: 140/290 cut-off events. [2023-01-27 18:12:12,182 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2023-01-27 18:12:12,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 290 events. 140/290 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1068 event pairs, 17 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 1024. Up to 165 conditions per place. [2023-01-27 18:12:12,183 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 32 selfloop transitions, 4 changer transitions 22/60 dead transitions. [2023-01-27 18:12:12,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 476 flow [2023-01-27 18:12:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:12:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:12:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-01-27 18:12:12,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45659603554340394 [2023-01-27 18:12:12,186 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-01-27 18:12:12,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-01-27 18:12:12,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:12:12,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-01-27 18:12:12,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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-01-27 18:12:12,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-27 18:12:12,190 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-27 18:12:12,191 INFO L175 Difference]: Start difference. First operand has 58 places, 28 transitions, 176 flow. Second operand 7 states and 668 transitions. [2023-01-27 18:12:12,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 476 flow [2023-01-27 18:12:12,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 360 flow, removed 32 selfloop flow, removed 15 redundant places. [2023-01-27 18:12:12,194 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 126 flow [2023-01-27 18:12:12,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-01-27 18:12:12,194 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-01-27 18:12:12,194 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 126 flow [2023-01-27 18:12:12,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-01-27 18:12:12,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:12:12,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:12:12,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:12:12,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:12:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -811390106, now seen corresponding path program 2 times [2023-01-27 18:12:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:12:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611391972] [2023-01-27 18:12:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:12:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:12:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:12:12,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:12:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:12:12,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:12:12,332 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:12:12,332 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:12:12,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:12:12,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:12:12,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:12:12,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:12:12,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:12:12,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:12:12,335 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:12:12,339 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:12:12,339 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:12:12,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:12:12 BasicIcfg [2023-01-27 18:12:12,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:12:12,404 INFO L158 Benchmark]: Toolchain (without parser) took 11671.69ms. Allocated memory was 392.2MB in the beginning and 566.2MB in the end (delta: 174.1MB). Free memory was 343.4MB in the beginning and 280.5MB in the end (delta: 62.9MB). Peak memory consumption was 238.9MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,404 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:12:12,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.69ms. Allocated memory is still 392.2MB. Free memory was 343.1MB in the beginning and 319.8MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.90ms. Allocated memory is still 392.2MB. Free memory was 319.8MB in the beginning and 317.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,405 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 392.2MB. Free memory was 317.5MB in the beginning and 315.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,405 INFO L158 Benchmark]: RCFGBuilder took 639.95ms. Allocated memory is still 392.2MB. Free memory was 315.4MB in the beginning and 332.7MB in the end (delta: -17.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,405 INFO L158 Benchmark]: TraceAbstraction took 10481.98ms. Allocated memory was 392.2MB in the beginning and 566.2MB in the end (delta: 174.1MB). Free memory was 332.1MB in the beginning and 280.5MB in the end (delta: 51.6MB). Peak memory consumption was 226.7MB. Max. memory is 16.0GB. [2023-01-27 18:12:12,406 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.15ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 465.69ms. Allocated memory is still 392.2MB. Free memory was 343.1MB in the beginning and 319.8MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.90ms. Allocated memory is still 392.2MB. Free memory was 319.8MB in the beginning and 317.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 392.2MB. Free memory was 317.5MB in the beginning and 315.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 639.95ms. Allocated memory is still 392.2MB. Free memory was 315.4MB in the beginning and 332.7MB in the end (delta: -17.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.0GB. * TraceAbstraction took 10481.98ms. Allocated memory was 392.2MB in the beginning and 566.2MB in the end (delta: 174.1MB). Free memory was 332.1MB in the beginning and 280.5MB in the end (delta: 51.6MB). Peak memory consumption was 226.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 117 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2392, independent: 2219, independent conditional: 0, independent unconditional: 2219, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1136, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2392, independent: 1124, independent conditional: 0, independent unconditional: 1124, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1136, unknown conditional: 0, unknown unconditional: 1136] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-2, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 848]: 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, 141 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.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 10 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1008 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-01-27 18:12:12,420 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...