./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-30 16:49:40,015 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-30 16:49:40,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-30 16:49:40,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-30 16:49:40,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-30 16:49:40,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-30 16:49:40,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-30 16:49:40,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-30 16:49:40,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-30 16:49:40,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-30 16:49:40,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-30 16:49:40,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-30 16:49:40,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-30 16:49:40,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-30 16:49:40,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-30 16:49:40,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-30 16:49:40,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-30 16:49:40,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-30 16:49:40,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-30 16:49:40,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-30 16:49:40,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-30 16:49:40,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-30 16:49:40,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-30 16:49:40,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-30 16:49:40,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-30 16:49:40,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-30 16:49:40,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-30 16:49:40,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-30 16:49:40,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-30 16:49:40,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-30 16:49:40,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-30 16:49:40,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-30 16:49:40,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-30 16:49:40,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-30 16:49:40,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-30 16:49:40,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-30 16:49:40,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-30 16:49:40,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-30 16:49:40,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-30 16:49:40,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-30 16:49:40,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-30 16:49:40,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-08-30 16:49:40,141 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-30 16:49:40,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-30 16:49:40,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-30 16:49:40,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-30 16:49:40,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-30 16:49:40,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-30 16:49:40,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-30 16:49:40,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-30 16:49:40,145 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-30 16:49:40,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-30 16:49:40,146 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-30 16:49:40,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-30 16:49:40,146 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-30 16:49:40,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-30 16:49:40,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-08-30 16:49:40,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-30 16:49:40,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-08-30 16:49:40,147 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-30 16:49:40,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2023-08-30 16:49:40,147 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-30 16:49:40,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-08-30 16:49:40,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-30 16:49:40,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-30 16:49:40,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-30 16:49:40,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 16:49:40,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-30 16:49:40,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-30 16:49:40,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-08-30 16:49:40,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-08-30 16:49:40,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-30 16:49:40,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-30 16:49:40,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-08-30 16:49:40,150 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-30 16:49:40,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-30 16:49:40,150 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-30 16:49:40,151 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER
[2023-08-30 16:49:40,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-30 16:49:40,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-30 16:49:40,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-30 16:49:40,481 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-30 16:49:40,481 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-30 16:49:40,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i
[2023-08-30 16:49:41,527 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-30 16:49:41,769 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-30 16:49:41,770 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i
[2023-08-30 16:49:41,782 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02012b469/e0b314265d594a909fe960a4f4872705/FLAG7ff4bf5c3
[2023-08-30 16:49:41,797 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02012b469/e0b314265d594a909fe960a4f4872705
[2023-08-30 16:49:41,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-30 16:49:41,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-30 16:49:41,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-30 16:49:41,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-30 16:49:41,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-30 16:49:41,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:41" (1/1) ...
[2023-08-30 16:49:41,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e69440b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:41, skipping insertion in model container
[2023-08-30 16:49:41,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:49:41" (1/1) ...
[2023-08-30 16:49:41,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-30 16:49:41,857 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-30 16:49:41,982 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/mix033.opt.i[944,957]
[2023-08-30 16:49:42,134 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 16:49:42,144 INFO L203 MainTranslator]: Completed pre-run
[2023-08-30 16:49:42,155 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/mix033.opt.i[944,957]
[2023-08-30 16:49:42,222 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-30 16:49:42,262 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 16:49:42,262 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 16:49:42,268 INFO L208 MainTranslator]: Completed translation
[2023-08-30 16:49:42,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42 WrapperNode
[2023-08-30 16:49:42,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-30 16:49:42,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-30 16:49:42,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-30 16:49:42,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-30 16:49:42,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,346 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138
[2023-08-30 16:49:42,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-30 16:49:42,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-30 16:49:42,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-30 16:49:42,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-30 16:49:42,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,390 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-30 16:49:42,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-30 16:49:42,405 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-30 16:49:42,405 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-30 16:49:42,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (1/1) ...
[2023-08-30 16:49:42,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 16:49:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-30 16:49:42,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-30 16:49:42,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-30 16:49:42,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-08-30 16:49:42,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-30 16:49:42,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-30 16:49:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-30 16:49:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-30 16:49:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-30 16:49:42,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-30 16:49:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-30 16:49:42,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-30 16:49:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-30 16:49:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-30 16:49:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-30 16:49:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-30 16:49:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-30 16:49:42,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-30 16:49:42,488 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-30 16:49:42,618 INFO L236 CfgBuilder]: Building ICFG
[2023-08-30 16:49:42,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-30 16:49:43,060 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-30 16:49:43,185 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-30 16:49:43,185 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-30 16:49:43,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:43 BoogieIcfgContainer
[2023-08-30 16:49:43,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-30 16:49:43,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-30 16:49:43,190 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-30 16:49:43,194 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-30 16:49:43,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:49:41" (1/3) ...
[2023-08-30 16:49:43,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d9582c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:43, skipping insertion in model container
[2023-08-30 16:49:43,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:49:42" (2/3) ...
[2023-08-30 16:49:43,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d9582c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:49:43, skipping insertion in model container
[2023-08-30 16:49:43,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:43" (3/3) ...
[2023-08-30 16:49:43,198 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i
[2023-08-30 16:49:43,210 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-08-30 16:49:43,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-30 16:49:43,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-08-30 16:49:43,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-30 16:49:43,280 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-30 16:49:43,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow
[2023-08-30 16:49:43,350 INFO L130 PetriNetUnfolder]: 2/111 cut-off events.
[2023-08-30 16:49:43,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 16:49:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place.
[2023-08-30 16:49:43,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow
[2023-08-30 16:49:43,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow
[2023-08-30 16:49:43,363 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-30 16:49:43,371 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow
[2023-08-30 16:49:43,374 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow
[2023-08-30 16:49:43,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow
[2023-08-30 16:49:43,402 INFO L130 PetriNetUnfolder]: 2/111 cut-off events.
[2023-08-30 16:49:43,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 16:49:43,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place.
[2023-08-30 16:49:43,404 INFO L119 LiptonReduction]: Number of co-enabled transitions 2048
[2023-08-30 16:49:46,835 INFO L134 LiptonReduction]: Checked pairs total: 5003
[2023-08-30 16:49:46,836 INFO L136 LiptonReduction]: Total number of compositions: 95
[2023-08-30 16:49:46,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-30 16:49:46,852 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c66c017, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-30 16:49:46,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-08-30 16:49:46,858 INFO L130 PetriNetUnfolder]: 0/12 cut-off events.
[2023-08-30 16:49:46,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 16:49:46,859 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:46,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:46,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:46,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 8883526, now seen corresponding path program 1 times
[2023-08-30 16:49:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731729770]
[2023-08-30 16:49:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731729770]
[2023-08-30 16:49:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731729770] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 16:49:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863541482]
[2023-08-30 16:49:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:47,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 16:49:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 16:49:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 16:49:47,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 209
[2023-08-30 16:49:47,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:47,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:47,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 209
[2023-08-30 16:49:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:47,685 INFO L130 PetriNetUnfolder]: 1164/1832 cut-off events.
[2023-08-30 16:49:47,685 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES.
[2023-08-30 16:49:47,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 1832 events. 1164/1832 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9159 event pairs, 188 based on Foata normal form. 75/1756 useless extension candidates. Maximal degree in co-relation 3590. Up to 1397 conditions per place.
[2023-08-30 16:49:47,701 INFO L137 encePairwiseOnDemand]: 205/209 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions.
[2023-08-30 16:49:47,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 149 flow
[2023-08-30 16:49:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-30 16:49:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 16:49:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions.
[2023-08-30 16:49:47,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470494417862839
[2023-08-30 16:49:47,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions.
[2023-08-30 16:49:47,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions.
[2023-08-30 16:49:47,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:47,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions.
[2023-08-30 16:49:47,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:47,735 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-08-30 16:49:47,736 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-08-30 16:49:47,737 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 343 transitions.
[2023-08-30 16:49:47,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 149 flow
[2023-08-30 16:49:47,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-30 16:49:47,742 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow
[2023-08-30 16:49:47,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22}
[2023-08-30 16:49:47,747 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places.
[2023-08-30 16:49:47,747 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow
[2023-08-30 16:49:47,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:47,749 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:47,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:47,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-30 16:49:47,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:47,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1637355170, now seen corresponding path program 1 times
[2023-08-30 16:49:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598290271]
[2023-08-30 16:49:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598290271]
[2023-08-30 16:49:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598290271] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:48,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:48,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-30 16:49:48,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065486781]
[2023-08-30 16:49:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 16:49:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:48,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 16:49:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 16:49:48,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 209
[2023-08-30 16:49:48,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:48,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:48,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 209
[2023-08-30 16:49:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:48,420 INFO L130 PetriNetUnfolder]: 2125/3230 cut-off events.
[2023-08-30 16:49:48,421 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES.
[2023-08-30 16:49:48,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6690 conditions, 3230 events. 2125/3230 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15992 event pairs, 691 based on Foata normal form. 176/3406 useless extension candidates. Maximal degree in co-relation 6680. Up to 2003 conditions per place.
[2023-08-30 16:49:48,449 INFO L137 encePairwiseOnDemand]: 200/209 looper letters, 32 selfloop transitions, 7 changer transitions 25/64 dead transitions.
[2023-08-30 16:49:48,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 274 flow
[2023-08-30 16:49:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 16:49:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 16:49:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions.
[2023-08-30 16:49:48,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48899521531100476
[2023-08-30 16:49:48,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions.
[2023-08-30 16:49:48,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions.
[2023-08-30 16:49:48,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:48,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions.
[2023-08-30 16:49:48,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:48,457 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-08-30 16:49:48,458 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-08-30 16:49:48,458 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 511 transitions.
[2023-08-30 16:49:48,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 274 flow
[2023-08-30 16:49:48,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 16:49:48,461 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 120 flow
[2023-08-30 16:49:48,462 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=28}
[2023-08-30 16:49:48,463 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places.
[2023-08-30 16:49:48,463 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 120 flow
[2023-08-30 16:49:48,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:48,463 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:48,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:48,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-30 16:49:48,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:48,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:48,465 INFO L85 PathProgramCache]: Analyzing trace with hash 781574661, now seen corresponding path program 1 times
[2023-08-30 16:49:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24472664]
[2023-08-30 16:49:48,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24472664]
[2023-08-30 16:49:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24472664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 16:49:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368737820]
[2023-08-30 16:49:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:48,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 16:49:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 16:49:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 16:49:48,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 209
[2023-08-30 16:49:48,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:48,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:48,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 209
[2023-08-30 16:49:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:49,160 INFO L130 PetriNetUnfolder]: 1829/2806 cut-off events.
[2023-08-30 16:49:49,160 INFO L131 PetriNetUnfolder]: For 2213/2213 co-relation queries the response was YES.
[2023-08-30 16:49:49,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 2806 events. 1829/2806 cut-off events. For 2213/2213 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13293 event pairs, 451 based on Foata normal form. 144/2950 useless extension candidates. Maximal degree in co-relation 8040. Up to 1395 conditions per place.
[2023-08-30 16:49:49,177 INFO L137 encePairwiseOnDemand]: 200/209 looper letters, 38 selfloop transitions, 8 changer transitions 28/74 dead transitions.
[2023-08-30 16:49:49,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 446 flow
[2023-08-30 16:49:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-30 16:49:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 16:49:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions.
[2023-08-30 16:49:49,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576
[2023-08-30 16:49:49,193 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 693 transitions.
[2023-08-30 16:49:49,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 693 transitions.
[2023-08-30 16:49:49,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:49,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 693 transitions.
[2023-08-30 16:49:49,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,198 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-08-30 16:49:49,198 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-08-30 16:49:49,199 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 120 flow. Second operand 7 states and 693 transitions.
[2023-08-30 16:49:49,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 446 flow
[2023-08-30 16:49:49,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 404 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-08-30 16:49:49,209 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 174 flow
[2023-08-30 16:49:49,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=45, PETRI_TRANSITIONS=32}
[2023-08-30 16:49:49,210 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places.
[2023-08-30 16:49:49,210 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 174 flow
[2023-08-30 16:49:49,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,211 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:49,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-30 16:49:49,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:49,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1576902373, now seen corresponding path program 1 times
[2023-08-30 16:49:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:49,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134197138]
[2023-08-30 16:49:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:49,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134197138]
[2023-08-30 16:49:49,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134197138] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:49,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-30 16:49:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507046958]
[2023-08-30 16:49:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:49,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 16:49:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 16:49:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 16:49:49,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 209
[2023-08-30 16:49:49,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:49,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 209
[2023-08-30 16:49:49,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:49,726 INFO L130 PetriNetUnfolder]: 1275/2056 cut-off events.
[2023-08-30 16:49:49,726 INFO L131 PetriNetUnfolder]: For 3188/3228 co-relation queries the response was YES.
[2023-08-30 16:49:49,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 2056 events. 1275/2056 cut-off events. For 3188/3228 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10548 event pairs, 369 based on Foata normal form. 128/2142 useless extension candidates. Maximal degree in co-relation 6221. Up to 1192 conditions per place.
[2023-08-30 16:49:49,740 INFO L137 encePairwiseOnDemand]: 205/209 looper letters, 34 selfloop transitions, 4 changer transitions 16/59 dead transitions.
[2023-08-30 16:49:49,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 386 flow
[2023-08-30 16:49:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 16:49:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 16:49:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions.
[2023-08-30 16:49:49,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507177033492823
[2023-08-30 16:49:49,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions.
[2023-08-30 16:49:49,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions.
[2023-08-30 16:49:49,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:49,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions.
[2023-08-30 16:49:49,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,746 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-08-30 16:49:49,747 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-08-30 16:49:49,747 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 174 flow. Second operand 5 states and 530 transitions.
[2023-08-30 16:49:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 386 flow
[2023-08-30 16:49:49,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 371 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-08-30 16:49:49,758 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 179 flow
[2023-08-30 16:49:49,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=46, PETRI_TRANSITIONS=32}
[2023-08-30 16:49:49,759 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places.
[2023-08-30 16:49:49,759 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 179 flow
[2023-08-30 16:49:49,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,760 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:49,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:49,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-30 16:49:49,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:49,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2143690253, now seen corresponding path program 1 times
[2023-08-30 16:49:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:49,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238927350]
[2023-08-30 16:49:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238927350]
[2023-08-30 16:49:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238927350] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:49,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 16:49:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963961407]
[2023-08-30 16:49:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 16:49:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 16:49:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 16:49:49,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209
[2023-08-30 16:49:49,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:49,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:49,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209
[2023-08-30 16:49:49,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:50,207 INFO L130 PetriNetUnfolder]: 917/1518 cut-off events.
[2023-08-30 16:49:50,207 INFO L131 PetriNetUnfolder]: For 2271/2328 co-relation queries the response was YES.
[2023-08-30 16:49:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 1518 events. 917/1518 cut-off events. For 2271/2328 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7661 event pairs, 169 based on Foata normal form. 161/1648 useless extension candidates. Maximal degree in co-relation 4743. Up to 897 conditions per place.
[2023-08-30 16:49:50,217 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 57 selfloop transitions, 7 changer transitions 19/88 dead transitions.
[2023-08-30 16:49:50,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 656 flow
[2023-08-30 16:49:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 16:49:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 16:49:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions.
[2023-08-30 16:49:50,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523444976076555
[2023-08-30 16:49:50,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions.
[2023-08-30 16:49:50,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions.
[2023-08-30 16:49:50,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:50,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions.
[2023-08-30 16:49:50,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:50,222 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-08-30 16:49:50,223 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-08-30 16:49:50,223 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 179 flow. Second operand 5 states and 547 transitions.
[2023-08-30 16:49:50,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 656 flow
[2023-08-30 16:49:50,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 616 flow, removed 7 selfloop flow, removed 6 redundant places.
[2023-08-30 16:49:50,228 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 217 flow
[2023-08-30 16:49:50,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2023-08-30 16:49:50,229 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places.
[2023-08-30 16:49:50,230 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 217 flow
[2023-08-30 16:49:50,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:50,230 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:50,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:50,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-30 16:49:50,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:50,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1678207601, now seen corresponding path program 1 times
[2023-08-30 16:49:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:50,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420236084]
[2023-08-30 16:49:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:50,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420236084]
[2023-08-30 16:49:50,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420236084] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 16:49:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216662284]
[2023-08-30 16:49:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 16:49:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:50,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 16:49:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 16:49:50,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209
[2023-08-30 16:49:50,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:50,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:50,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209
[2023-08-30 16:49:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:50,764 INFO L130 PetriNetUnfolder]: 672/1166 cut-off events.
[2023-08-30 16:49:50,765 INFO L131 PetriNetUnfolder]: For 1901/2000 co-relation queries the response was YES.
[2023-08-30 16:49:50,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 1166 events. 672/1166 cut-off events. For 1901/2000 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5895 event pairs, 79 based on Foata normal form. 134/1278 useless extension candidates. Maximal degree in co-relation 4323. Up to 404 conditions per place.
[2023-08-30 16:49:50,771 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 68 selfloop transitions, 13 changer transitions 32/118 dead transitions.
[2023-08-30 16:49:50,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 118 transitions, 906 flow
[2023-08-30 16:49:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-30 16:49:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 16:49:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions.
[2023-08-30 16:49:50,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228981544771019
[2023-08-30 16:49:50,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions.
[2023-08-30 16:49:50,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions.
[2023-08-30 16:49:50,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:50,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions.
[2023-08-30 16:49:50,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:50,780 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-08-30 16:49:50,780 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-08-30 16:49:50,781 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 217 flow. Second operand 7 states and 765 transitions.
[2023-08-30 16:49:50,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 118 transitions, 906 flow
[2023-08-30 16:49:50,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 118 transitions, 902 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 16:49:50,787 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 301 flow
[2023-08-30 16:49:50,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=53, PETRI_TRANSITIONS=44}
[2023-08-30 16:49:50,790 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places.
[2023-08-30 16:49:50,790 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 301 flow
[2023-08-30 16:49:50,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:50,793 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:50,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:50,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-30 16:49:50,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:50,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 770902945, now seen corresponding path program 1 times
[2023-08-30 16:49:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:50,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812795415]
[2023-08-30 16:49:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:51,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812795415]
[2023-08-30 16:49:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812795415] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 16:49:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903666506]
[2023-08-30 16:49:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:51,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 16:49:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 16:49:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-30 16:49:51,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 209
[2023-08-30 16:49:51,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:51,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 209
[2023-08-30 16:49:51,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:51,382 INFO L130 PetriNetUnfolder]: 608/1053 cut-off events.
[2023-08-30 16:49:51,382 INFO L131 PetriNetUnfolder]: For 2674/2784 co-relation queries the response was YES.
[2023-08-30 16:49:51,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4381 conditions, 1053 events. 608/1053 cut-off events. For 2674/2784 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5366 event pairs, 70 based on Foata normal form. 65/1097 useless extension candidates. Maximal degree in co-relation 4356. Up to 377 conditions per place.
[2023-08-30 16:49:51,389 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 64 selfloop transitions, 17 changer transitions 32/118 dead transitions.
[2023-08-30 16:49:51,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 964 flow
[2023-08-30 16:49:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-08-30 16:49:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-30 16:49:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions.
[2023-08-30 16:49:51,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108984582668793
[2023-08-30 16:49:51,393 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 961 transitions.
[2023-08-30 16:49:51,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 961 transitions.
[2023-08-30 16:49:51,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:51,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 961 transitions.
[2023-08-30 16:49:51,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,399 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,399 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 301 flow. Second operand 9 states and 961 transitions.
[2023-08-30 16:49:51,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 964 flow
[2023-08-30 16:49:51,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 118 transitions, 898 flow, removed 14 selfloop flow, removed 4 redundant places.
[2023-08-30 16:49:51,413 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 314 flow
[2023-08-30 16:49:51,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=60, PETRI_TRANSITIONS=45}
[2023-08-30 16:49:51,414 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places.
[2023-08-30 16:49:51,414 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 314 flow
[2023-08-30 16:49:51,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,414 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:51,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:51,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-30 16:49:51,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:51,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1915510624, now seen corresponding path program 1 times
[2023-08-30 16:49:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:51,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50860014]
[2023-08-30 16:49:51,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50860014]
[2023-08-30 16:49:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50860014] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 16:49:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863910057]
[2023-08-30 16:49:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 16:49:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 16:49:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 16:49:51,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209
[2023-08-30 16:49:51,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:51,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209
[2023-08-30 16:49:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:51,969 INFO L130 PetriNetUnfolder]: 795/1451 cut-off events.
[2023-08-30 16:49:51,969 INFO L131 PetriNetUnfolder]: For 4582/4610 co-relation queries the response was YES.
[2023-08-30 16:49:51,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 1451 events. 795/1451 cut-off events. For 4582/4610 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8110 event pairs, 160 based on Foata normal form. 13/1460 useless extension candidates. Maximal degree in co-relation 6064. Up to 827 conditions per place.
[2023-08-30 16:49:51,976 INFO L137 encePairwiseOnDemand]: 205/209 looper letters, 35 selfloop transitions, 1 changer transitions 56/93 dead transitions.
[2023-08-30 16:49:51,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 848 flow
[2023-08-30 16:49:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 16:49:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 16:49:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions.
[2023-08-30 16:49:51,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49856459330143543
[2023-08-30 16:49:51,978 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions.
[2023-08-30 16:49:51,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions.
[2023-08-30 16:49:51,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:51,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions.
[2023-08-30 16:49:51,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:51,982 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-08-30 16:49:51,982 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-08-30 16:49:51,983 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 314 flow. Second operand 5 states and 521 transitions.
[2023-08-30 16:49:51,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 848 flow
[2023-08-30 16:49:51,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 689 flow, removed 43 selfloop flow, removed 9 redundant places.
[2023-08-30 16:49:51,999 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 177 flow
[2023-08-30 16:49:51,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=33}
[2023-08-30 16:49:52,000 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places.
[2023-08-30 16:49:52,000 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 177 flow
[2023-08-30 16:49:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:52,001 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:52,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:52,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-30 16:49:52,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:52,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -923062406, now seen corresponding path program 2 times
[2023-08-30 16:49:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886517420]
[2023-08-30 16:49:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 16:49:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 16:49:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 16:49:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886517420]
[2023-08-30 16:49:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886517420] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 16:49:52,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 16:49:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 16:49:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196509064]
[2023-08-30 16:49:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 16:49:52,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 16:49:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 16:49:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 16:49:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 16:49:52,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 209
[2023-08-30 16:49:52,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:52,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 16:49:52,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 209
[2023-08-30 16:49:52,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 16:49:52,362 INFO L130 PetriNetUnfolder]: 184/374 cut-off events.
[2023-08-30 16:49:52,363 INFO L131 PetriNetUnfolder]: For 542/542 co-relation queries the response was YES.
[2023-08-30 16:49:52,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 374 events. 184/374 cut-off events. For 542/542 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1464 event pairs, 56 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1319. Up to 228 conditions per place.
[2023-08-30 16:49:52,365 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 29 selfloop transitions, 4 changer transitions 18/51 dead transitions.
[2023-08-30 16:49:52,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 370 flow
[2023-08-30 16:49:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-30 16:49:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 16:49:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions.
[2023-08-30 16:49:52,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421
[2023-08-30 16:49:52,367 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions.
[2023-08-30 16:49:52,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions.
[2023-08-30 16:49:52,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 16:49:52,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions.
[2023-08-30 16:49:52,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:52,371 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-08-30 16:49:52,371 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-08-30 16:49:52,371 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 177 flow. Second operand 5 states and 484 transitions.
[2023-08-30 16:49:52,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 370 flow
[2023-08-30 16:49:52,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 339 flow, removed 11 selfloop flow, removed 8 redundant places.
[2023-08-30 16:49:52,374 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 142 flow
[2023-08-30 16:49:52,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=28}
[2023-08-30 16:49:52,375 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places.
[2023-08-30 16:49:52,375 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 142 flow
[2023-08-30 16:49:52,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 16:49:52,376 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-30 16:49:52,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:52,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-30 16:49:52,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-08-30 16:49:52,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 16:49:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1339701696, now seen corresponding path program 3 times
[2023-08-30 16:49:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 16:49:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710166254]
[2023-08-30 16:49:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 16:49:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 16:49:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 16:49:52,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-30 16:49:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 16:49:52,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-30 16:49:52,474 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-30 16:49:52,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2023-08-30 16:49:52,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2023-08-30 16:49:52,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2023-08-30 16:49:52,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2023-08-30 16:49:52,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2023-08-30 16:49:52,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2023-08-30 16:49:52,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-30 16:49:52,478 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 16:49:52,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-30 16:49:52,484 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-30 16:49:52,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:49:52 BasicIcfg
[2023-08-30 16:49:52,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-30 16:49:52,568 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-30 16:49:52,568 INFO L271 PluginConnector]: Initializing Witness Printer...
[2023-08-30 16:49:52,568 INFO L275 PluginConnector]: Witness Printer initialized
[2023-08-30 16:49:52,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:49:43" (3/4) ...
[2023-08-30 16:49:52,571 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-08-30 16:49:52,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2023-08-30 16:49:52,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-30 16:49:52,658 INFO L158 Benchmark]: Toolchain (without parser) took 10857.76ms. Allocated memory was 88.1MB in the beginning and 356.5MB in the end (delta: 268.4MB). Free memory was 66.9MB in the beginning and 107.1MB in the end (delta: -40.2MB). Peak memory consumption was 226.6MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,658 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 16:49:52,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.22ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 64.1MB in the end (delta: 2.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.11ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,659 INFO L158 Benchmark]: Boogie Preprocessor took 55.31ms. Allocated memory is still 88.1MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,659 INFO L158 Benchmark]: RCFGBuilder took 783.50ms. Allocated memory is still 88.1MB. Free memory was 59.9MB in the beginning and 56.2MB in the end (delta: 3.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,659 INFO L158 Benchmark]: TraceAbstraction took 9377.52ms. Allocated memory was 88.1MB in the beginning and 356.5MB in the end (delta: 268.4MB). Free memory was 55.5MB in the beginning and 118.6MB in the end (delta: -63.1MB). Peak memory consumption was 206.4MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,660 INFO L158 Benchmark]: Witness Printer took 89.10ms. Allocated memory is still 356.5MB. Free memory was 118.6MB in the beginning and 107.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-08-30 16:49:52,661 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.19ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 468.22ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 64.1MB in the end (delta: 2.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 77.11ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 55.31ms. Allocated memory is still 88.1MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 783.50ms. Allocated memory is still 88.1MB. Free memory was 59.9MB in the beginning and 56.2MB in the end (delta: 3.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 9377.52ms. Allocated memory was 88.1MB in the beginning and 356.5MB in the end (delta: 268.4MB). Free memory was 55.5MB in the beginning and 118.6MB in the end (delta: -63.1MB). Peak memory consumption was 206.4MB. Max. memory is 16.1GB.
* Witness Printer took 89.10ms. Allocated memory is still 356.5MB. Free memory was 118.6MB in the beginning and 107.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 3.5s, 119 PlacesBefore, 35 PlacesAfterwards, 111 TransitionsBefore, 26 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 5003 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2184, independent: 2000, independent conditional: 0, independent unconditional: 2000, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1102, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2184, independent: 933, independent conditional: 0, independent unconditional: 933, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1102, unknown conditional: 0, unknown unconditional: 1102] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p1_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 int __unbuffered_p2_EBX = 0;
[L719] 0 int a = 0;
[L721] 0 int b = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L729] 0 int z = 0;
[L730] 0 _Bool z$flush_delayed;
[L731] 0 int z$mem_tmp;
[L732] 0 _Bool z$r_buff0_thd0;
[L733] 0 _Bool z$r_buff0_thd1;
[L734] 0 _Bool z$r_buff0_thd2;
[L735] 0 _Bool z$r_buff0_thd3;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$read_delayed;
[L741] 0 int *z$read_delayed_var;
[L742] 0 int z$w_buff0;
[L743] 0 _Bool z$w_buff0_used;
[L744] 0 int z$w_buff1;
[L745] 0 _Bool z$w_buff1_used;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L843] 0 pthread_t t876;
[L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=7, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L845] 0 pthread_t t877;
[L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=8, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L847] 0 pthread_t t878;
[L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=9, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800] 3 z$w_buff1 = z$w_buff0
[L801] 3 z$w_buff0 = 1
[L802] 3 z$w_buff1_used = z$w_buff0_used
[L803] 3 z$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0
[L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1
[L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2
[L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3
[L809] 3 z$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812] 3 a = 1
[L815] 3 __unbuffered_p2_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818] 3 __unbuffered_p2_EBX = b
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 b = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L766] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769] 2 y = 1
[L772] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 z$flush_delayed = weak$$choice2
[L778] 2 z$mem_tmp = z
[L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = z
[L787] 2 z = z$flush_delayed ? z$mem_tmp : z
[L788] 2 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L795] 2 return 0;
[L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L761] 1 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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 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.
- 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.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 143 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: 9.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 949 IncrementalHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 37 mSDtfsCounter, 949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=7, InterpolantAutomatonStates: 51, 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, 1.9s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-08-30 16:49:52,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE