/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:45:16,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:45:16,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:45:16,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:45:16,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:45:16,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:45:16,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:45:16,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:45:16,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:45:16,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:45:16,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:45:16,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:45:16,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:45:16,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:45:16,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:45:16,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:45:16,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:45:16,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:45:16,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:45:16,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:45:16,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:45:16,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:45:16,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:45:16,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:45:16,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:45:16,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:45:16,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:45:16,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:45:16,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:45:16,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:45:16,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:45:16,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:45:16,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:45:16,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:45:16,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:45:16,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:45:16,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:45:16,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:45:16,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:45:16,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:45:16,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:45:16,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:45:16,995 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:45:16,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:45:16,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:45:16,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:45:16,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:45:16,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:45:16,997 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:45:16,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:45:16,998 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:45:16,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:45:16,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:45:16,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:45:16,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:45:16,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:16,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:45:16,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:45:17,000 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:45:17,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:45:17,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:45:17,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:45:17,219 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:45:17,220 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:45:17,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-01-28 00:45:18,259 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:45:18,485 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:45:18,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-01-28 00:45:18,504 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d950527d6/ccabc82e2ab04272aa2ca0128d1e783e/FLAG9d3968ebb [2023-01-28 00:45:18,517 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d950527d6/ccabc82e2ab04272aa2ca0128d1e783e [2023-01-28 00:45:18,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:45:18,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:45:18,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:18,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:45:18,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:45:18,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:18,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35193f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18, skipping insertion in model container [2023-01-28 00:45:18,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:18,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:45:18,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:45:18,698 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/safe000_rmo.i[988,1001] [2023-01-28 00:45:18,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:18,906 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:45:18,915 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/safe000_rmo.i[988,1001] [2023-01-28 00:45:18,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:18,993 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:18,993 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:18,997 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:45:18,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18 WrapperNode [2023-01-28 00:45:18,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:18,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:18,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:45:18,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:45:19,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,055 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-01-28 00:45:19,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:19,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:45:19,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:45:19,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:45:19,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,087 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:45:19,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:45:19,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:45:19,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:45:19,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (1/1) ... [2023-01-28 00:45:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:19,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:45:19,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:45:19,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:45:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:45:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:45:19,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:45:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:45:19,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:45:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:45:19,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:45:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:45:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:45:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:45:19,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:45:19,188 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:45:19,339 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:45:19,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:45:19,672 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:45:19,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:45:19,847 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:45:19,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:19 BoogieIcfgContainer [2023-01-28 00:45:19,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:45:19,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:45:19,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:45:19,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:45:19,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:45:18" (1/3) ... [2023-01-28 00:45:19,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428aa05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:19, skipping insertion in model container [2023-01-28 00:45:19,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:18" (2/3) ... [2023-01-28 00:45:19,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428aa05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:19, skipping insertion in model container [2023-01-28 00:45:19,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:19" (3/3) ... [2023-01-28 00:45:19,854 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-01-28 00:45:19,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:45:19,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 00:45:19,865 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:45:19,917 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:45:19,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 00:45:19,992 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 00:45:19,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:19,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 00:45:19,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-01-28 00:45:20,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:20,005 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:45:20,021 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:20,028 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:20,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-01-28 00:45:20,061 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-01-28 00:45:20,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:20,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-01-28 00:45:20,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-01-28 00:45:25,718 INFO L134 LiptonReduction]: Checked pairs total: 3777 [2023-01-28 00:45:25,718 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-28 00:45:25,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:45:25,732 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c9fa03e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:45:25,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 00:45:25,736 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2023-01-28 00:45:25,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:25,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:25,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:25,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:25,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -378234055, now seen corresponding path program 1 times [2023-01-28 00:45:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939612924] [2023-01-28 00:45:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939612924] [2023-01-28 00:45:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939612924] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:45:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182504235] [2023-01-28 00:45:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 00:45:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 00:45:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 00:45:25,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217 [2023-01-28 00:45:25,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:25,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:25,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217 [2023-01-28 00:45:25,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:26,086 INFO L130 PetriNetUnfolder]: 511/808 cut-off events. [2023-01-28 00:45:26,086 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 00:45:26,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 808 events. 511/808 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3533 event pairs, 511 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1616. Up to 783 conditions per place. [2023-01-28 00:45:26,095 INFO L137 encePairwiseOnDemand]: 216/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-01-28 00:45:26,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 87 flow [2023-01-28 00:45:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 00:45:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 00:45:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-01-28 00:45:26,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2023-01-28 00:45:26,109 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-01-28 00:45:26,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-01-28 00:45:26,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:26,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-01-28 00:45:26,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,120 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,121 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 245 transitions. [2023-01-28 00:45:26,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 87 flow [2023-01-28 00:45:26,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:26,125 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 48 flow [2023-01-28 00:45:26,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-01-28 00:45:26,129 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-28 00:45:26,129 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 48 flow [2023-01-28 00:45:26,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:26,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:45:26,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:26,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1159102893, now seen corresponding path program 1 times [2023-01-28 00:45:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816432560] [2023-01-28 00:45:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816432560] [2023-01-28 00:45:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816432560] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:26,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:26,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:45:26,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489933333] [2023-01-28 00:45:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:26,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:26,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-01-28 00:45:26,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:26,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-01-28 00:45:26,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:26,778 INFO L130 PetriNetUnfolder]: 521/860 cut-off events. [2023-01-28 00:45:26,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:26,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 860 events. 521/860 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4021 event pairs, 168 based on Foata normal form. 48/904 useless extension candidates. Maximal degree in co-relation 1708. Up to 604 conditions per place. [2023-01-28 00:45:26,781 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 25 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-01-28 00:45:26,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 178 flow [2023-01-28 00:45:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-01-28 00:45:26,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2023-01-28 00:45:26,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-01-28 00:45:26,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-01-28 00:45:26,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:26,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-01-28 00:45:26,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,791 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 48 flow. Second operand 5 states and 588 transitions. [2023-01-28 00:45:26,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 178 flow [2023-01-28 00:45:26,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:45:26,792 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow [2023-01-28 00:45:26,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-01-28 00:45:26,793 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-01-28 00:45:26,793 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow [2023-01-28 00:45:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:26,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:26,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:26,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:45:26,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:26,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1572474054, now seen corresponding path program 1 times [2023-01-28 00:45:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684030535] [2023-01-28 00:45:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684030535] [2023-01-28 00:45:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684030535] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446302783] [2023-01-28 00:45:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:27,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:27,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 217 [2023-01-28 00:45:27,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:27,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 217 [2023-01-28 00:45:27,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:27,281 INFO L130 PetriNetUnfolder]: 459/777 cut-off events. [2023-01-28 00:45:27,281 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-01-28 00:45:27,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 777 events. 459/777 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3633 event pairs, 114 based on Foata normal form. 36/809 useless extension candidates. Maximal degree in co-relation 1708. Up to 496 conditions per place. [2023-01-28 00:45:27,284 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 23 selfloop transitions, 2 changer transitions 12/40 dead transitions. [2023-01-28 00:45:27,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 177 flow [2023-01-28 00:45:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-01-28 00:45:27,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2023-01-28 00:45:27,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-01-28 00:45:27,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-01-28 00:45:27,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:27,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-01-28 00:45:27,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,289 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 589 transitions. [2023-01-28 00:45:27,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 177 flow [2023-01-28 00:45:27,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 167 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:27,293 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 64 flow [2023-01-28 00:45:27,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-01-28 00:45:27,294 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-28 00:45:27,296 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 64 flow [2023-01-28 00:45:27,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:27,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:27,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:45:27,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:27,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -82500333, now seen corresponding path program 1 times [2023-01-28 00:45:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166191458] [2023-01-28 00:45:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:27,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166191458] [2023-01-28 00:45:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166191458] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:27,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859133806] [2023-01-28 00:45:27,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:27,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 217 [2023-01-28 00:45:27,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 64 flow. Second operand has 5 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-01-28 00:45:27,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:27,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 217 [2023-01-28 00:45:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:27,818 INFO L130 PetriNetUnfolder]: 692/1119 cut-off events. [2023-01-28 00:45:27,818 INFO L131 PetriNetUnfolder]: For 248/248 co-relation queries the response was YES. [2023-01-28 00:45:27,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 1119 events. 692/1119 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5542 event pairs, 207 based on Foata normal form. 36/1147 useless extension candidates. Maximal degree in co-relation 2587. Up to 343 conditions per place. [2023-01-28 00:45:27,822 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 33 selfloop transitions, 3 changer transitions 18/56 dead transitions. [2023-01-28 00:45:27,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 263 flow [2023-01-28 00:45:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:45:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:45:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-01-28 00:45:27,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360983102918587 [2023-01-28 00:45:27,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-01-28 00:45:27,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-01-28 00:45:27,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:27,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-01-28 00:45:27,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:27,833 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 64 flow. Second operand 6 states and 698 transitions. [2023-01-28 00:45:27,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 263 flow [2023-01-28 00:45:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:27,838 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 74 flow [2023-01-28 00:45:27,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-01-28 00:45:27,839 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-01-28 00:45:27,840 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 74 flow [2023-01-28 00:45:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-01-28 00:45:27,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:27,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:45:27,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:27,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -545466893, now seen corresponding path program 1 times [2023-01-28 00:45:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675850530] [2023-01-28 00:45:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675850530] [2023-01-28 00:45:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675850530] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:29,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:45:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363654791] [2023-01-28 00:45:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:29,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:45:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:45:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:45:29,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 00:45:29,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 74 flow. Second operand has 9 states, 9 states have (on average 86.44444444444444) internal successors, (778), 9 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:29,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:29,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 00:45:29,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:29,479 INFO L130 PetriNetUnfolder]: 472/760 cut-off events. [2023-01-28 00:45:29,480 INFO L131 PetriNetUnfolder]: For 469/470 co-relation queries the response was YES. [2023-01-28 00:45:29,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 760 events. 472/760 cut-off events. For 469/470 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2871 event pairs, 174 based on Foata normal form. 32/791 useless extension candidates. Maximal degree in co-relation 1876. Up to 596 conditions per place. [2023-01-28 00:45:29,483 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 27 selfloop transitions, 3 changer transitions 11/42 dead transitions. [2023-01-28 00:45:29,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 213 flow [2023-01-28 00:45:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-01-28 00:45:29,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4313364055299539 [2023-01-28 00:45:29,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-01-28 00:45:29,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-01-28 00:45:29,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:29,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-01-28 00:45:29,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:29,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:29,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:29,488 INFO L175 Difference]: Start difference. First operand has 40 places, 21 transitions, 74 flow. Second operand 5 states and 468 transitions. [2023-01-28 00:45:29,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 213 flow [2023-01-28 00:45:29,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 191 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-01-28 00:45:29,489 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 85 flow [2023-01-28 00:45:29,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2023-01-28 00:45:29,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-01-28 00:45:29,491 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 85 flow [2023-01-28 00:45:29,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.44444444444444) internal successors, (778), 9 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:29,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:29,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:29,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:45:29,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:29,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -448149755, now seen corresponding path program 1 times [2023-01-28 00:45:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985668512] [2023-01-28 00:45:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985668512] [2023-01-28 00:45:30,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985668512] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:45:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373065993] [2023-01-28 00:45:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:30,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:45:30,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:45:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:45:30,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-01-28 00:45:30,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 85 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:30,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:30,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-01-28 00:45:30,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:30,606 INFO L130 PetriNetUnfolder]: 686/1094 cut-off events. [2023-01-28 00:45:30,606 INFO L131 PetriNetUnfolder]: For 576/577 co-relation queries the response was YES. [2023-01-28 00:45:30,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1094 events. 686/1094 cut-off events. For 576/577 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4608 event pairs, 147 based on Foata normal form. 30/1123 useless extension candidates. Maximal degree in co-relation 2838. Up to 431 conditions per place. [2023-01-28 00:45:30,610 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 34 selfloop transitions, 4 changer transitions 23/62 dead transitions. [2023-01-28 00:45:30,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 332 flow [2023-01-28 00:45:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:45:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:45:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2023-01-28 00:45:30,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445468509984639 [2023-01-28 00:45:30,612 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2023-01-28 00:45:30,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2023-01-28 00:45:30,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:30,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2023-01-28 00:45:30,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:30,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:30,614 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:30,614 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 85 flow. Second operand 6 states and 580 transitions. [2023-01-28 00:45:30,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 332 flow [2023-01-28 00:45:30,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:30,618 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 116 flow [2023-01-28 00:45:30,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-01-28 00:45:30,620 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-01-28 00:45:30,620 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 116 flow [2023-01-28 00:45:30,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:30,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:30,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:30,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:45:30,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:30,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:30,622 INFO L85 PathProgramCache]: Analyzing trace with hash 845714217, now seen corresponding path program 2 times [2023-01-28 00:45:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:30,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253090629] [2023-01-28 00:45:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253090629] [2023-01-28 00:45:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253090629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:45:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124896754] [2023-01-28 00:45:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:45:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:45:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:45:31,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-01-28 00:45:31,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:31,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:31,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-01-28 00:45:31,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:31,628 INFO L130 PetriNetUnfolder]: 435/713 cut-off events. [2023-01-28 00:45:31,628 INFO L131 PetriNetUnfolder]: For 729/730 co-relation queries the response was YES. [2023-01-28 00:45:31,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 713 events. 435/713 cut-off events. For 729/730 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2725 event pairs, 253 based on Foata normal form. 30/742 useless extension candidates. Maximal degree in co-relation 2060. Up to 563 conditions per place. [2023-01-28 00:45:31,632 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 28 selfloop transitions, 7 changer transitions 12/48 dead transitions. [2023-01-28 00:45:31,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 290 flow [2023-01-28 00:45:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:45:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:45:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2023-01-28 00:45:31,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769585253456221 [2023-01-28 00:45:31,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 621 transitions. [2023-01-28 00:45:31,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 621 transitions. [2023-01-28 00:45:31,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:31,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 621 transitions. [2023-01-28 00:45:31,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:31,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:31,636 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:31,636 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 116 flow. Second operand 6 states and 621 transitions. [2023-01-28 00:45:31,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 290 flow [2023-01-28 00:45:31,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 271 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:31,639 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 149 flow [2023-01-28 00:45:31,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-01-28 00:45:31,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-01-28 00:45:31,640 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 149 flow [2023-01-28 00:45:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:31,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:31,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:31,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:45:31,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:31,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 925839514, now seen corresponding path program 1 times [2023-01-28 00:45:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:31,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987818947] [2023-01-28 00:45:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:32,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:32,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987818947] [2023-01-28 00:45:32,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987818947] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:32,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:45:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593717605] [2023-01-28 00:45:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:32,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:45:32,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:32,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:45:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:45:32,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 00:45:32,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:32,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:32,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 00:45:32,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:32,810 INFO L130 PetriNetUnfolder]: 462/765 cut-off events. [2023-01-28 00:45:32,810 INFO L131 PetriNetUnfolder]: For 1324/1325 co-relation queries the response was YES. [2023-01-28 00:45:32,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 765 events. 462/765 cut-off events. For 1324/1325 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3056 event pairs, 69 based on Foata normal form. 40/804 useless extension candidates. Maximal degree in co-relation 2505. Up to 370 conditions per place. [2023-01-28 00:45:32,813 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 31 selfloop transitions, 4 changer transitions 28/64 dead transitions. [2023-01-28 00:45:32,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 435 flow [2023-01-28 00:45:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2023-01-28 00:45:32,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298880842659645 [2023-01-28 00:45:32,815 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2023-01-28 00:45:32,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2023-01-28 00:45:32,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:32,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2023-01-28 00:45:32,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:32,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:32,819 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:32,819 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 149 flow. Second operand 7 states and 653 transitions. [2023-01-28 00:45:32,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 435 flow [2023-01-28 00:45:32,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 399 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:32,823 INFO L231 Difference]: Finished difference. Result has 51 places, 26 transitions, 140 flow [2023-01-28 00:45:32,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=26} [2023-01-28 00:45:32,824 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-01-28 00:45:32,824 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 140 flow [2023-01-28 00:45:32,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:32,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:32,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:32,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:45:32,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:32,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1068793665, now seen corresponding path program 3 times [2023-01-28 00:45:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92651698] [2023-01-28 00:45:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92651698] [2023-01-28 00:45:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92651698] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 00:45:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014741926] [2023-01-28 00:45:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 00:45:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 00:45:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-01-28 00:45:34,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-01-28 00:45:34,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 26 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:34,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:34,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-01-28 00:45:34,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:34,364 INFO L130 PetriNetUnfolder]: 331/554 cut-off events. [2023-01-28 00:45:34,364 INFO L131 PetriNetUnfolder]: For 1282/1282 co-relation queries the response was YES. [2023-01-28 00:45:34,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 554 events. 331/554 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1920 event pairs, 41 based on Foata normal form. 24/578 useless extension candidates. Maximal degree in co-relation 1823. Up to 257 conditions per place. [2023-01-28 00:45:34,367 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 39 selfloop transitions, 9 changer transitions 7/56 dead transitions. [2023-01-28 00:45:34,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 380 flow [2023-01-28 00:45:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 627 transitions. [2023-01-28 00:45:34,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412771560236998 [2023-01-28 00:45:34,369 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 627 transitions. [2023-01-28 00:45:34,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 627 transitions. [2023-01-28 00:45:34,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:34,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 627 transitions. [2023-01-28 00:45:34,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:34,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:34,372 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:34,372 INFO L175 Difference]: Start difference. First operand has 51 places, 26 transitions, 140 flow. Second operand 7 states and 627 transitions. [2023-01-28 00:45:34,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 380 flow [2023-01-28 00:45:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 332 flow, removed 14 selfloop flow, removed 10 redundant places. [2023-01-28 00:45:34,375 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 152 flow [2023-01-28 00:45:34,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-01-28 00:45:34,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-01-28 00:45:34,376 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 152 flow [2023-01-28 00:45:34,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:34,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:34,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:45:34,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:34,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash 198822626, now seen corresponding path program 1 times [2023-01-28 00:45:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:34,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761719715] [2023-01-28 00:45:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761719715] [2023-01-28 00:45:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761719715] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:45:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081292873] [2023-01-28 00:45:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:35,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:45:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:35,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:45:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:45:35,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-01-28 00:45:35,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:35,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-01-28 00:45:35,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:35,625 INFO L130 PetriNetUnfolder]: 373/614 cut-off events. [2023-01-28 00:45:35,625 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2023-01-28 00:45:35,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 614 events. 373/614 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2212 event pairs, 92 based on Foata normal form. 16/630 useless extension candidates. Maximal degree in co-relation 1977. Up to 455 conditions per place. [2023-01-28 00:45:35,628 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 32 selfloop transitions, 11 changer transitions 8/52 dead transitions. [2023-01-28 00:45:35,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 352 flow [2023-01-28 00:45:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2023-01-28 00:45:35,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-01-28 00:45:35,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2023-01-28 00:45:35,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2023-01-28 00:45:35,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:35,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2023-01-28 00:45:35,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,633 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,633 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 152 flow. Second operand 7 states and 713 transitions. [2023-01-28 00:45:35,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 352 flow [2023-01-28 00:45:35,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 334 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:35,636 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 220 flow [2023-01-28 00:45:35,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-01-28 00:45:35,637 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-01-28 00:45:35,637 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 220 flow [2023-01-28 00:45:35,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:35,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:45:35,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:35,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 947000612, now seen corresponding path program 1 times [2023-01-28 00:45:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701353221] [2023-01-28 00:45:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701353221] [2023-01-28 00:45:35,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701353221] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:35,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:35,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011615132] [2023-01-28 00:45:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:35,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 00:45:35,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:35,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 00:45:35,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:35,937 INFO L130 PetriNetUnfolder]: 262/478 cut-off events. [2023-01-28 00:45:35,938 INFO L131 PetriNetUnfolder]: For 941/974 co-relation queries the response was YES. [2023-01-28 00:45:35,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 478 events. 262/478 cut-off events. For 941/974 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1977 event pairs, 64 based on Foata normal form. 69/543 useless extension candidates. Maximal degree in co-relation 1548. Up to 329 conditions per place. [2023-01-28 00:45:35,940 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 7 changer transitions 11/68 dead transitions. [2023-01-28 00:45:35,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 500 flow [2023-01-28 00:45:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2023-01-28 00:45:35,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317972350230414 [2023-01-28 00:45:35,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2023-01-28 00:45:35,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2023-01-28 00:45:35,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:35,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2023-01-28 00:45:35,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,944 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,944 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 220 flow. Second operand 5 states and 577 transitions. [2023-01-28 00:45:35,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 500 flow [2023-01-28 00:45:35,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 478 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:35,947 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 263 flow [2023-01-28 00:45:35,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-01-28 00:45:35,947 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-01-28 00:45:35,947 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 263 flow [2023-01-28 00:45:35,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:35,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:35,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:45:35,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:35,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 657257936, now seen corresponding path program 1 times [2023-01-28 00:45:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380621812] [2023-01-28 00:45:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380621812] [2023-01-28 00:45:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380621812] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671243546] [2023-01-28 00:45:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:36,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:36,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 00:45:36,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:36,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 00:45:36,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:36,289 INFO L130 PetriNetUnfolder]: 174/353 cut-off events. [2023-01-28 00:45:36,289 INFO L131 PetriNetUnfolder]: For 843/869 co-relation queries the response was YES. [2023-01-28 00:45:36,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 353 events. 174/353 cut-off events. For 843/869 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1502 event pairs, 12 based on Foata normal form. 52/403 useless extension candidates. Maximal degree in co-relation 1374. Up to 146 conditions per place. [2023-01-28 00:45:36,291 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 43 selfloop transitions, 13 changer transitions 15/77 dead transitions. [2023-01-28 00:45:36,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 590 flow [2023-01-28 00:45:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-01-28 00:45:36,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286372613561554 [2023-01-28 00:45:36,293 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-01-28 00:45:36,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-01-28 00:45:36,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:36,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-01-28 00:45:36,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,296 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,296 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 263 flow. Second operand 7 states and 803 transitions. [2023-01-28 00:45:36,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 590 flow [2023-01-28 00:45:36,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 555 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 00:45:36,299 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 282 flow [2023-01-28 00:45:36,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-01-28 00:45:36,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2023-01-28 00:45:36,299 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 282 flow [2023-01-28 00:45:36,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:36,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:36,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:45:36,300 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:36,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1125255683, now seen corresponding path program 1 times [2023-01-28 00:45:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845160790] [2023-01-28 00:45:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:36,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:36,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845160790] [2023-01-28 00:45:36,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845160790] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:36,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:36,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909673674] [2023-01-28 00:45:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:36,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:36,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 217 [2023-01-28 00:45:36,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:36,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:36,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 217 [2023-01-28 00:45:36,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:37,122 INFO L130 PetriNetUnfolder]: 234/456 cut-off events. [2023-01-28 00:45:37,123 INFO L131 PetriNetUnfolder]: For 1863/1864 co-relation queries the response was YES. [2023-01-28 00:45:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 456 events. 234/456 cut-off events. For 1863/1864 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1878 event pairs, 89 based on Foata normal form. 4/459 useless extension candidates. Maximal degree in co-relation 2147. Up to 374 conditions per place. [2023-01-28 00:45:37,125 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 35 selfloop transitions, 10 changer transitions 16/62 dead transitions. [2023-01-28 00:45:37,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 583 flow [2023-01-28 00:45:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:45:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:45:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-01-28 00:45:37,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2023-01-28 00:45:37,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-01-28 00:45:37,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-01-28 00:45:37,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:37,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-01-28 00:45:37,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:37,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:37,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:37,130 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 282 flow. Second operand 6 states and 610 transitions. [2023-01-28 00:45:37,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 583 flow [2023-01-28 00:45:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 529 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:37,134 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 301 flow [2023-01-28 00:45:37,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2023-01-28 00:45:37,134 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2023-01-28 00:45:37,134 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 301 flow [2023-01-28 00:45:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:37,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:37,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:37,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:45:37,136 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:37,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1516841057, now seen corresponding path program 2 times [2023-01-28 00:45:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175246216] [2023-01-28 00:45:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:37,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175246216] [2023-01-28 00:45:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175246216] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 00:45:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304175549] [2023-01-28 00:45:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 00:45:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 00:45:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-01-28 00:45:38,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-01-28 00:45:38,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 86.7) internal successors, (867), 10 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:38,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-01-28 00:45:38,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:38,642 INFO L130 PetriNetUnfolder]: 125/256 cut-off events. [2023-01-28 00:45:38,642 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2023-01-28 00:45:38,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 256 events. 125/256 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 835 event pairs, 30 based on Foata normal form. 4/260 useless extension candidates. Maximal degree in co-relation 1234. Up to 105 conditions per place. [2023-01-28 00:45:38,643 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 41 selfloop transitions, 16 changer transitions 4/62 dead transitions. [2023-01-28 00:45:38,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 578 flow [2023-01-28 00:45:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:45:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:45:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 725 transitions. [2023-01-28 00:45:38,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176267281105991 [2023-01-28 00:45:38,646 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 725 transitions. [2023-01-28 00:45:38,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 725 transitions. [2023-01-28 00:45:38,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:38,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 725 transitions. [2023-01-28 00:45:38,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,649 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,649 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 301 flow. Second operand 8 states and 725 transitions. [2023-01-28 00:45:38,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 578 flow [2023-01-28 00:45:38,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 512 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-01-28 00:45:38,652 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 316 flow [2023-01-28 00:45:38,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-01-28 00:45:38,653 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2023-01-28 00:45:38,653 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 316 flow [2023-01-28 00:45:38,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.7) internal successors, (867), 10 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:38,653 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-01-28 00:45:38,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:45:38,653 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:38,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1144784950, now seen corresponding path program 1 times [2023-01-28 00:45:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524413249] [2023-01-28 00:45:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524413249] [2023-01-28 00:45:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524413249] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:38,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:38,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:45:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296254259] [2023-01-28 00:45:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:38,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:38,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 217 [2023-01-28 00:45:38,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:38,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 217 [2023-01-28 00:45:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:38,925 INFO L130 PetriNetUnfolder]: 81/183 cut-off events. [2023-01-28 00:45:38,926 INFO L131 PetriNetUnfolder]: For 464/470 co-relation queries the response was YES. [2023-01-28 00:45:38,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 183 events. 81/183 cut-off events. For 464/470 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 666 event pairs, 6 based on Foata normal form. 16/196 useless extension candidates. Maximal degree in co-relation 787. Up to 72 conditions per place. [2023-01-28 00:45:38,927 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 44 selfloop transitions, 11 changer transitions 5/68 dead transitions. [2023-01-28 00:45:38,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 618 flow [2023-01-28 00:45:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:45:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:45:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2023-01-28 00:45:38,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5187623436471362 [2023-01-28 00:45:38,929 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2023-01-28 00:45:38,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2023-01-28 00:45:38,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:38,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2023-01-28 00:45:38,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,932 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,932 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 316 flow. Second operand 7 states and 788 transitions. [2023-01-28 00:45:38,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 618 flow [2023-01-28 00:45:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 518 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-01-28 00:45:38,937 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 291 flow [2023-01-28 00:45:38,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-01-28 00:45:38,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2023-01-28 00:45:38,938 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 291 flow [2023-01-28 00:45:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:38,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:38,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:45:38,938 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 00:45:38,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2059235957, now seen corresponding path program 1 times [2023-01-28 00:45:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280559498] [2023-01-28 00:45:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:38,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:45:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:39,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:45:39,087 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:45:39,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 00:45:39,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 00:45:39,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 00:45:39,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 00:45:39,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:45:39,090 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:39,094 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:45:39,094 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:45:39,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:45:39 BasicIcfg [2023-01-28 00:45:39,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:45:39,170 INFO L158 Benchmark]: Toolchain (without parser) took 20650.03ms. Allocated memory was 559.9MB in the beginning and 1.2GB in the end (delta: 631.2MB). Free memory was 508.7MB in the beginning and 550.2MB in the end (delta: -41.5MB). Peak memory consumption was 593.9MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,170 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 314.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:45:39,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.83ms. Allocated memory is still 559.9MB. Free memory was 508.7MB in the beginning and 483.1MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.00ms. Allocated memory is still 559.9MB. Free memory was 483.1MB in the beginning and 480.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,171 INFO L158 Benchmark]: Boogie Preprocessor took 51.66ms. Allocated memory is still 559.9MB. Free memory was 480.3MB in the beginning and 477.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,171 INFO L158 Benchmark]: RCFGBuilder took 735.86ms. Allocated memory is still 559.9MB. Free memory was 477.8MB in the beginning and 470.0MB in the end (delta: 7.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,171 INFO L158 Benchmark]: TraceAbstraction took 19319.64ms. Allocated memory was 559.9MB in the beginning and 1.2GB in the end (delta: 631.2MB). Free memory was 470.0MB in the beginning and 550.2MB in the end (delta: -80.2MB). Peak memory consumption was 553.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:39,172 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.11ms. Allocated memory is still 364.9MB. Free memory is still 314.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 475.83ms. Allocated memory is still 559.9MB. Free memory was 508.7MB in the beginning and 483.1MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.00ms. Allocated memory is still 559.9MB. Free memory was 483.1MB in the beginning and 480.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.66ms. Allocated memory is still 559.9MB. Free memory was 480.3MB in the beginning and 477.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 735.86ms. Allocated memory is still 559.9MB. Free memory was 477.8MB in the beginning and 470.0MB in the end (delta: 7.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.0GB. * TraceAbstraction took 19319.64ms. Allocated memory was 559.9MB in the beginning and 1.2GB in the end (delta: 631.2MB). Free memory was 470.0MB in the beginning and 550.2MB in the end (delta: -80.2MB). Peak memory consumption was 553.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 119 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1409, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 614, independent: 584, independent conditional: 0, independent unconditional: 584, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1409, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 614, unknown conditional: 0, unknown unconditional: 614] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=-2, t1789={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=-1, t1789={7:0}, t1790={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; [L791] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 150 locations, 4 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: 19.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 10 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=14, InterpolantAutomatonStates: 89, 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.6s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 3401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:45:39,197 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...