/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/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 23:39:16,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 23:39:16,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 23:39:16,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 23:39:16,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 23:39:16,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 23:39:16,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 23:39:16,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 23:39:16,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 23:39:16,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 23:39:16,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 23:39:16,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 23:39:16,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 23:39:16,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 23:39:16,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 23:39:16,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 23:39:16,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 23:39:16,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 23:39:16,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 23:39:16,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 23:39:16,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 23:39:16,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 23:39:16,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 23:39:16,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 23:39:16,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 23:39:16,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 23:39:16,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 23:39:16,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 23:39:16,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 23:39:16,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 23:39:16,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 23:39:16,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 23:39:16,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 23:39:16,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 23:39:16,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 23:39:16,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 23:39:16,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 23:39:16,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 23:39:16,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 23:39:16,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 23:39:16,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 23:39:16,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 23:39:16,145 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 23:39:16,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 23:39:16,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 23:39:16,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 23:39:16,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 23:39:16,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 23:39:16,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 23:39:16,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 23:39:16,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 23:39:16,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 23:39:16,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 23:39:16,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 23:39:16,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 23:39:16,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 23:39:16,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 23:39:16,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 23:39:16,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 23:39:16,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 23:39:16,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 23:39:16,152 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-27 23:39:16,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 23:39:16,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 23:39:16,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 23:39:16,390 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 23:39:16,391 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 23:39:16,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-01-27 23:39:17,447 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 23:39:17,705 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 23:39:17,705 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-01-27 23:39:17,718 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a54df38/be7f8849009d4062a32472ec74800bc2/FLAG5be0a646a [2023-01-27 23:39:17,735 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a54df38/be7f8849009d4062a32472ec74800bc2 [2023-01-27 23:39:17,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 23:39:17,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 23:39:17,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 23:39:17,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 23:39:17,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 23:39:17,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:39:17" (1/1) ... [2023-01-27 23:39:17,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5315e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:17, skipping insertion in model container [2023-01-27 23:39:17,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:39:17" (1/1) ... [2023-01-27 23:39:17,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 23:39:17,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 23:39:18,136 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/queue_ok.i[43266,43279] [2023-01-27 23:39:18,144 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/queue_ok.i[43543,43556] [2023-01-27 23:39:18,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 23:39:18,166 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 23:39:18,227 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/queue_ok.i[43266,43279] [2023-01-27 23:39:18,232 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/queue_ok.i[43543,43556] [2023-01-27 23:39:18,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 23:39:18,333 INFO L208 MainTranslator]: Completed translation [2023-01-27 23:39:18,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18 WrapperNode [2023-01-27 23:39:18,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 23:39:18,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 23:39:18,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 23:39:18,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 23:39:18,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,403 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-01-27 23:39:18,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 23:39:18,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 23:39:18,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 23:39:18,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 23:39:18,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,461 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 23:39:18,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 23:39:18,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 23:39:18,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 23:39:18,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (1/1) ... [2023-01-27 23:39:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 23:39:18,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:18,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 23:39:18,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 23:39:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-01-27 23:39:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-01-27 23:39:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-01-27 23:39:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-01-27 23:39:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 23:39:18,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 23:39:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 23:39:18,531 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 23:39:18,703 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 23:39:18,705 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 23:39:19,041 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 23:39:19,049 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 23:39:19,049 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-27 23:39:19,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:39:19 BoogieIcfgContainer [2023-01-27 23:39:19,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 23:39:19,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 23:39:19,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 23:39:19,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 23:39:19,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:39:17" (1/3) ... [2023-01-27 23:39:19,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672be6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:39:19, skipping insertion in model container [2023-01-27 23:39:19,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:39:18" (2/3) ... [2023-01-27 23:39:19,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672be6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:39:19, skipping insertion in model container [2023-01-27 23:39:19,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:39:19" (3/3) ... [2023-01-27 23:39:19,066 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-01-27 23:39:19,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 23:39:19,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 23:39:19,081 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 23:39:19,224 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 23:39:19,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-01-27 23:39:19,367 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-01-27 23:39:19,367 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 23:39:19,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 13/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 359 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-01-27 23:39:19,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-01-27 23:39:19,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-01-27 23:39:19,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 23:39:19,403 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-01-27 23:39:19,406 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-01-27 23:39:19,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-01-27 23:39:19,447 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-01-27 23:39:19,447 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-27 23:39:19,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 205 events. 13/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-01-27 23:39:19,462 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-01-27 23:39:25,325 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-01-27 23:39:25,325 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-01-27 23:39:25,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 23:39:25,342 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;@1b8c5da7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 23:39:25,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 23:39:25,343 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-01-27 23:39:25,343 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 23:39:25,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:25,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-01-27 23:39:25,344 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 2 more)] === [2023-01-27 23:39:25,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-01-27 23:39:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415164509] [2023-01-27 23:39:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415164509] [2023-01-27 23:39:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415164509] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:39:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-01-27 23:39:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749031780] [2023-01-27 23:39:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:25,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 23:39:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:25,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 23:39:25,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 23:39:25,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-01-27 23:39:25,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:25,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:25,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-01-27 23:39:25,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:25,676 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-01-27 23:39:25,676 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-01-27 23:39:25,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1341 events. 829/1341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5736 event pairs, 621 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 2519. Up to 1297 conditions per place. [2023-01-27 23:39:25,684 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-01-27 23:39:25,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-01-27 23:39:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 23:39:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 23:39:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-01-27 23:39:25,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-01-27 23:39:25,704 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-01-27 23:39:25,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-01-27 23:39:25,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:25,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-01-27 23:39:25,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.0) internal successors, (450), 2 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:25,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:25,719 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:25,720 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-01-27 23:39:25,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-01-27 23:39:25,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 23:39:25,726 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-01-27 23:39:25,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-01-27 23:39:25,732 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-01-27 23:39:25,732 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-01-27 23:39:25,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:25,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:25,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:25,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 23:39:25,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:25,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-01-27 23:39:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071846524] [2023-01-27 23:39:25,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:25,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:26,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071846524] [2023-01-27 23:39:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071846524] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:39:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 23:39:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82060892] [2023-01-27 23:39:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:26,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:39:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:26,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:39:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:39:26,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-01-27 23:39:26,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:26,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-01-27 23:39:26,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:26,141 INFO L130 PetriNetUnfolder]: 248/490 cut-off events. [2023-01-27 23:39:26,141 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-01-27 23:39:26,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 490 events. 248/490 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2048 event pairs, 164 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 980. Up to 253 conditions per place. [2023-01-27 23:39:26,144 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2023-01-27 23:39:26,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 209 flow [2023-01-27 23:39:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:39:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:39:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-01-27 23:39:26,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-01-27 23:39:26,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:26,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,153 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-01-27 23:39:26,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 209 flow [2023-01-27 23:39:26,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 23:39:26,155 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 94 flow [2023-01-27 23:39:26,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-01-27 23:39:26,157 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-01-27 23:39:26,157 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 94 flow [2023-01-27 23:39:26,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:26,158 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-27 23:39:26,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 23:39:26,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:26,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-01-27 23:39:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732462492] [2023-01-27 23:39:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732462492] [2023-01-27 23:39:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732462492] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:39:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:39:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767543126] [2023-01-27 23:39:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:26,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:39:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:26,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:39:26,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:39:26,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-27 23:39:26,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:26,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-27 23:39:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:26,342 INFO L130 PetriNetUnfolder]: 245/490 cut-off events. [2023-01-27 23:39:26,342 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-27 23:39:26,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 490 events. 245/490 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1755 event pairs, 155 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1020. Up to 357 conditions per place. [2023-01-27 23:39:26,345 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-01-27 23:39:26,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2023-01-27 23:39:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:39:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:39:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-01-27 23:39:26,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-01-27 23:39:26,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:26,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-01-27 23:39:26,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,353 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-01-27 23:39:26,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2023-01-27 23:39:26,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 23:39:26,355 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 109 flow [2023-01-27 23:39:26,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-01-27 23:39:26,355 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-01-27 23:39:26,356 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 109 flow [2023-01-27 23:39:26,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:26,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:26,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 23:39:26,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:26,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-01-27 23:39:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176553855] [2023-01-27 23:39:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176553855] [2023-01-27 23:39:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176553855] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:39:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 23:39:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480572345] [2023-01-27 23:39:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 23:39:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 23:39:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 23:39:26,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 402 [2023-01-27 23:39:26,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:26,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 402 [2023-01-27 23:39:26,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:26,580 INFO L130 PetriNetUnfolder]: 187/394 cut-off events. [2023-01-27 23:39:26,581 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-27 23:39:26,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 394 events. 187/394 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1256 event pairs, 12 based on Foata normal form. 42/410 useless extension candidates. Maximal degree in co-relation 865. Up to 341 conditions per place. [2023-01-27 23:39:26,582 INFO L137 encePairwiseOnDemand]: 399/402 looper letters, 43 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-01-27 23:39:26,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 216 flow [2023-01-27 23:39:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 23:39:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 23:39:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2023-01-27 23:39:26,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207296849087893 [2023-01-27 23:39:26,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2023-01-27 23:39:26,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2023-01-27 23:39:26,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:26,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2023-01-27 23:39:26,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,589 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 109 flow. Second operand 3 states and 628 transitions. [2023-01-27 23:39:26,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 216 flow [2023-01-27 23:39:26,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 23:39:26,591 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 112 flow [2023-01-27 23:39:26,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-01-27 23:39:26,592 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-01-27 23:39:26,592 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 112 flow [2023-01-27 23:39:26,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:26,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:26,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 23:39:26,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:26,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-01-27 23:39:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:26,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830718562] [2023-01-27 23:39:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830718562] [2023-01-27 23:39:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830718562] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469929045] [2023-01-27 23:39:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:26,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:26,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 23:39:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:26,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-27 23:39:26,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:39:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469929045] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:39:26,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:39:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-01-27 23:39:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234017361] [2023-01-27 23:39:26,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:39:26,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 23:39:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 23:39:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-27 23:39:26,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-27 23:39:26,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:26,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:26,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-27 23:39:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:27,126 INFO L130 PetriNetUnfolder]: 246/531 cut-off events. [2023-01-27 23:39:27,126 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-01-27 23:39:27,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 531 events. 246/531 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1513 event pairs, 100 based on Foata normal form. 12/507 useless extension candidates. Maximal degree in co-relation 1194. Up to 238 conditions per place. [2023-01-27 23:39:27,129 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2023-01-27 23:39:27,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 370 flow [2023-01-27 23:39:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 23:39:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 23:39:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2023-01-27 23:39:27,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269485903814262 [2023-01-27 23:39:27,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions. [2023-01-27 23:39:27,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions. [2023-01-27 23:39:27,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:27,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions. [2023-01-27 23:39:27,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:27,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:27,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:27,142 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 112 flow. Second operand 6 states and 1271 transitions. [2023-01-27 23:39:27,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 370 flow [2023-01-27 23:39:27,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 23:39:27,144 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 170 flow [2023-01-27 23:39:27,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-01-27 23:39:27,145 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2023-01-27 23:39:27,145 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 170 flow [2023-01-27 23:39:27,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:27,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:27,147 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:27,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 23:39:27,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:27,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:27,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-01-27 23:39:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073664630] [2023-01-27 23:39:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073664630] [2023-01-27 23:39:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073664630] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591627226] [2023-01-27 23:39:27,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 23:39:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:27,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:27,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 23:39:27,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 23:39:27,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:39:27,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 23:39:27,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:27,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:39:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591627226] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:39:27,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:39:27,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-01-27 23:39:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411874104] [2023-01-27 23:39:27,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:39:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 23:39:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 23:39:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-27 23:39:27,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-27 23:39:27,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 170 flow. Second operand has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:27,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:27,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-27 23:39:27,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:28,208 INFO L130 PetriNetUnfolder]: 423/934 cut-off events. [2023-01-27 23:39:28,208 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-01-27 23:39:28,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 934 events. 423/934 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2534 event pairs, 91 based on Foata normal form. 24/900 useless extension candidates. Maximal degree in co-relation 2357. Up to 217 conditions per place. [2023-01-27 23:39:28,213 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-01-27 23:39:28,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 161 transitions, 836 flow [2023-01-27 23:39:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 23:39:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 23:39:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2540 transitions. [2023-01-27 23:39:28,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265339966832504 [2023-01-27 23:39:28,219 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2540 transitions. [2023-01-27 23:39:28,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2540 transitions. [2023-01-27 23:39:28,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:28,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2540 transitions. [2023-01-27 23:39:28,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 211.66666666666666) internal successors, (2540), 12 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:28,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:28,232 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:28,232 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 170 flow. Second operand 12 states and 2540 transitions. [2023-01-27 23:39:28,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 161 transitions, 836 flow [2023-01-27 23:39:28,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 161 transitions, 797 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-01-27 23:39:28,237 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 320 flow [2023-01-27 23:39:28,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-01-27 23:39:28,238 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2023-01-27 23:39:28,238 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 320 flow [2023-01-27 23:39:28,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:28,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:28,239 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:28,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 23:39:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 23:39:28,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:28,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-01-27 23:39:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399355615] [2023-01-27 23:39:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399355615] [2023-01-27 23:39:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399355615] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571340828] [2023-01-27 23:39:28,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 23:39:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:28,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 23:39:29,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-27 23:39:29,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:39:29,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 70 conjunts are in the unsatisfiable core [2023-01-27 23:39:29,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:29,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 23:39:29,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:29,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 23:39:29,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:29,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-27 23:39:29,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-01-27 23:39:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-01-27 23:39:29,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 23:39:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571340828] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 23:39:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-01-27 23:39:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28829470] [2023-01-27 23:39:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:29,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 23:39:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 23:39:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-01-27 23:39:29,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 402 [2023-01-27 23:39:29,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 162.57142857142858) internal successors, (1138), 7 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:29,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:29,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 402 [2023-01-27 23:39:29,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:30,211 INFO L130 PetriNetUnfolder]: 725/1582 cut-off events. [2023-01-27 23:39:30,212 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2023-01-27 23:39:30,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 1582 events. 725/1582 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5513 event pairs, 159 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 4235. Up to 992 conditions per place. [2023-01-27 23:39:30,220 INFO L137 encePairwiseOnDemand]: 394/402 looper letters, 89 selfloop transitions, 11 changer transitions 1/103 dead transitions. [2023-01-27 23:39:30,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 730 flow [2023-01-27 23:39:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 23:39:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 23:39:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2023-01-27 23:39:30,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41998341625207297 [2023-01-27 23:39:30,223 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2023-01-27 23:39:30,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2023-01-27 23:39:30,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:30,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2023-01-27 23:39:30,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:30,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:30,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:30,229 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 320 flow. Second operand 6 states and 1013 transitions. [2023-01-27 23:39:30,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 730 flow [2023-01-27 23:39:30,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 714 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 23:39:30,236 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 398 flow [2023-01-27 23:39:30,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-01-27 23:39:30,237 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2023-01-27 23:39:30,237 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 398 flow [2023-01-27 23:39:30,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 162.57142857142858) internal successors, (1138), 7 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:30,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:30,238 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:30,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 23:39:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:30,445 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:30,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -345088948, now seen corresponding path program 1 times [2023-01-27 23:39:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543403625] [2023-01-27 23:39:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543403625] [2023-01-27 23:39:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543403625] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990796412] [2023-01-27 23:39:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:30,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:30,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 23:39:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:30,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 23:39:30,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:31,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:39:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 23:39:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990796412] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:39:31,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:39:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-01-27 23:39:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698538093] [2023-01-27 23:39:31,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:39:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 23:39:31,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:31,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 23:39:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-01-27 23:39:31,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-01-27 23:39:31,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 398 flow. Second operand has 23 states, 23 states have (on average 204.56521739130434) internal successors, (4705), 23 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:31,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:31,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-01-27 23:39:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:32,068 INFO L130 PetriNetUnfolder]: 1178/2745 cut-off events. [2023-01-27 23:39:32,069 INFO L131 PetriNetUnfolder]: For 4953/4953 co-relation queries the response was YES. [2023-01-27 23:39:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8932 conditions, 2745 events. 1178/2745 cut-off events. For 4953/4953 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 9881 event pairs, 137 based on Foata normal form. 80/2801 useless extension candidates. Maximal degree in co-relation 8912. Up to 680 conditions per place. [2023-01-27 23:39:32,086 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 344 selfloop transitions, 43 changer transitions 0/390 dead transitions. [2023-01-27 23:39:32,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 390 transitions, 2835 flow [2023-01-27 23:39:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-27 23:39:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-27 23:39:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4654 transitions. [2023-01-27 23:39:32,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526232473993668 [2023-01-27 23:39:32,097 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4654 transitions. [2023-01-27 23:39:32,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4654 transitions. [2023-01-27 23:39:32,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:32,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4654 transitions. [2023-01-27 23:39:32,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 211.54545454545453) internal successors, (4654), 22 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:32,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 402.0) internal successors, (9246), 23 states have internal predecessors, (9246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:32,120 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 402.0) internal successors, (9246), 23 states have internal predecessors, (9246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:32,120 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 398 flow. Second operand 22 states and 4654 transitions. [2023-01-27 23:39:32,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 390 transitions, 2835 flow [2023-01-27 23:39:32,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 390 transitions, 2834 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 23:39:32,134 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 780 flow [2023-01-27 23:39:32,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=780, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2023-01-27 23:39:32,135 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2023-01-27 23:39:32,135 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 780 flow [2023-01-27 23:39:32,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 204.56521739130434) internal successors, (4705), 23 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:32,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:32,137 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:32,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-27 23:39:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:32,343 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:32,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -541637280, now seen corresponding path program 2 times [2023-01-27 23:39:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:32,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006349581] [2023-01-27 23:39:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2023-01-27 23:39:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006349581] [2023-01-27 23:39:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006349581] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 23:39:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 23:39:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016859946] [2023-01-27 23:39:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:34,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 23:39:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 23:39:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 23:39:34,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 402 [2023-01-27 23:39:34,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 780 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:34,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:34,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 402 [2023-01-27 23:39:34,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:35,102 INFO L130 PetriNetUnfolder]: 1283/2838 cut-off events. [2023-01-27 23:39:35,102 INFO L131 PetriNetUnfolder]: For 4916/4916 co-relation queries the response was YES. [2023-01-27 23:39:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 2838 events. 1283/2838 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 9969 event pairs, 797 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 9883. Up to 2813 conditions per place. [2023-01-27 23:39:35,121 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 93 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2023-01-27 23:39:35,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 1044 flow [2023-01-27 23:39:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 23:39:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 23:39:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2023-01-27 23:39:35,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41459369817578773 [2023-01-27 23:39:35,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2023-01-27 23:39:35,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2023-01-27 23:39:35,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:35,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2023-01-27 23:39:35,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.66666666666666) internal successors, (1000), 6 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:35,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:35,130 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:35,130 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 780 flow. Second operand 6 states and 1000 transitions. [2023-01-27 23:39:35,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 1044 flow [2023-01-27 23:39:35,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 1008 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-01-27 23:39:35,157 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 827 flow [2023-01-27 23:39:35,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2023-01-27 23:39:35,158 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2023-01-27 23:39:35,158 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 827 flow [2023-01-27 23:39:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:35,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:35,159 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:35,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 23:39:35,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:35,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash -49729782, now seen corresponding path program 3 times [2023-01-27 23:39:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460235098] [2023-01-27 23:39:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 613 proven. 53 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2023-01-27 23:39:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460235098] [2023-01-27 23:39:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460235098] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283410945] [2023-01-27 23:39:38,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 23:39:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:38,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:38,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 23:39:40,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-01-27 23:39:40,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:39:40,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 135 conjunts are in the unsatisfiable core [2023-01-27 23:39:40,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:40,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:40,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:40,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-01-27 23:39:40,309 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-01-27 23:39:40,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2023-01-27 23:39:40,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-01-27 23:39:40,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-01-27 23:39:40,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:40,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-01-27 23:39:40,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-01-27 23:39:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2023-01-27 23:39:40,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 23:39:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283410945] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 23:39:40,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 23:39:40,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2023-01-27 23:39:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902969925] [2023-01-27 23:39:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 23:39:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 23:39:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 23:39:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-01-27 23:39:40,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 402 [2023-01-27 23:39:40,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 827 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:40,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:40,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 402 [2023-01-27 23:39:40,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:41,334 INFO L130 PetriNetUnfolder]: 1289/2853 cut-off events. [2023-01-27 23:39:41,334 INFO L131 PetriNetUnfolder]: For 5300/5300 co-relation queries the response was YES. [2023-01-27 23:39:41,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 2853 events. 1289/2853 cut-off events. For 5300/5300 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10353 event pairs, 434 based on Foata normal form. 3/2832 useless extension candidates. Maximal degree in co-relation 10433. Up to 2777 conditions per place. [2023-01-27 23:39:41,356 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 103 selfloop transitions, 9 changer transitions 1/115 dead transitions. [2023-01-27 23:39:41,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 115 transitions, 1111 flow [2023-01-27 23:39:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 23:39:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 23:39:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2023-01-27 23:39:41,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050580431177446 [2023-01-27 23:39:41,359 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 977 transitions. [2023-01-27 23:39:41,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 977 transitions. [2023-01-27 23:39:41,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:41,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 977 transitions. [2023-01-27 23:39:41,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:41,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:41,365 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:41,365 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 827 flow. Second operand 6 states and 977 transitions. [2023-01-27 23:39:41,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 115 transitions, 1111 flow [2023-01-27 23:39:41,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 1087 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-01-27 23:39:41,389 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 865 flow [2023-01-27 23:39:41,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2023-01-27 23:39:41,391 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 66 predicate places. [2023-01-27 23:39:41,391 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 865 flow [2023-01-27 23:39:41,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:41,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:41,391 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:41,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 23:39:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-27 23:39:41,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:41,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1311907394, now seen corresponding path program 4 times [2023-01-27 23:39:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376604835] [2023-01-27 23:39:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2023-01-27 23:39:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376604835] [2023-01-27 23:39:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376604835] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707360065] [2023-01-27 23:39:44,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 23:39:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:44,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:44,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 23:39:44,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 23:39:44,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:39:44,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-27 23:39:44,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:45,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 23:39:45,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:45,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 23:39:45,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:45,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-27 23:39:45,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-01-27 23:39:45,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-01-27 23:39:45,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:45,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 23:39:45,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:45,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-27 23:39:45,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-01-27 23:39:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 665 proven. 35 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-01-27 23:39:45,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:39:45,402 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-27 23:39:45,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1)))))) is different from false [2023-01-27 23:39:45,436 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))) is different from false [2023-01-27 23:39:45,457 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1838) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-27 23:39:45,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1837)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1838) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1844) .cse1) 20))))) is different from false [2023-01-27 23:39:45,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:39:45,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 147 [2023-01-27 23:39:45,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:39:45,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 265 [2023-01-27 23:39:45,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2023-01-27 23:39:45,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 23:39:45,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-01-27 23:39:45,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 23:39:45,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 91 [2023-01-27 23:39:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 632 proven. 31 refuted. 0 times theorem prover too weak. 495 trivial. 37 not checked. [2023-01-27 23:39:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707360065] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 23:39:45,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 23:39:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-01-27 23:39:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146356996] [2023-01-27 23:39:45,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 23:39:45,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-27 23:39:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 23:39:45,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-27 23:39:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=614, Unknown=7, NotChecked=290, Total=1122 [2023-01-27 23:39:45,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 402 [2023-01-27 23:39:45,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 865 flow. Second operand has 34 states, 34 states have (on average 158.85294117647058) internal successors, (5401), 34 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:45,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 23:39:45,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 402 [2023-01-27 23:39:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 23:39:48,085 INFO L130 PetriNetUnfolder]: 2349/5332 cut-off events. [2023-01-27 23:39:48,085 INFO L131 PetriNetUnfolder]: For 11791/11791 co-relation queries the response was YES. [2023-01-27 23:39:48,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20435 conditions, 5332 events. 2349/5332 cut-off events. For 11791/11791 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 24570 event pairs, 161 based on Foata normal form. 137/5433 useless extension candidates. Maximal degree in co-relation 20396. Up to 1994 conditions per place. [2023-01-27 23:39:48,124 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 206 selfloop transitions, 52 changer transitions 1/261 dead transitions. [2023-01-27 23:39:48,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 261 transitions, 2606 flow [2023-01-27 23:39:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 23:39:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 23:39:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2943 transitions. [2023-01-27 23:39:48,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2023-01-27 23:39:48,133 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2943 transitions. [2023-01-27 23:39:48,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2943 transitions. [2023-01-27 23:39:48,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 23:39:48,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2943 transitions. [2023-01-27 23:39:48,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 163.5) internal successors, (2943), 18 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:48,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 402.0) internal successors, (7638), 19 states have internal predecessors, (7638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:48,150 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 402.0) internal successors, (7638), 19 states have internal predecessors, (7638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:48,150 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 865 flow. Second operand 18 states and 2943 transitions. [2023-01-27 23:39:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 261 transitions, 2606 flow [2023-01-27 23:39:48,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 261 transitions, 2588 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-27 23:39:48,213 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 1278 flow [2023-01-27 23:39:48,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1278, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2023-01-27 23:39:48,214 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 87 predicate places. [2023-01-27 23:39:48,214 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 1278 flow [2023-01-27 23:39:48,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 158.85294117647058) internal successors, (5401), 34 states have internal predecessors, (5401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 23:39:48,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 23:39:48,216 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 23:39:48,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 23:39:48,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:48,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 23:39:48,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 23:39:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 259927122, now seen corresponding path program 5 times [2023-01-27 23:39:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 23:39:48,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810362649] [2023-01-27 23:39:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 23:39:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 23:39:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 23:39:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 678 proven. 60 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2023-01-27 23:39:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 23:39:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810362649] [2023-01-27 23:39:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810362649] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 23:39:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655053727] [2023-01-27 23:39:52,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 23:39:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 23:39:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 23:39:52,278 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 23:39:52,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 23:39:56,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-01-27 23:39:56,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 23:39:56,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 199 conjunts are in the unsatisfiable core [2023-01-27 23:39:56,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 23:39:56,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-01-27 23:39:56,273 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-27 23:39:56,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-01-27 23:39:56,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:56,416 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-01-27 23:39:56,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-01-27 23:39:56,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:56,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-01-27 23:39:56,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-01-27 23:39:56,715 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-27 23:39:56,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-27 23:39:56,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:56,861 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-27 23:39:56,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2023-01-27 23:39:56,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:56,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-01-27 23:39:57,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-01-27 23:39:57,121 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-27 23:39:57,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-27 23:39:57,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:57,293 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-27 23:39:57,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2023-01-27 23:39:57,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:57,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-01-27 23:39:57,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-01-27 23:39:57,556 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-27 23:39:57,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2023-01-27 23:39:57,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:57,697 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-27 23:39:57,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2023-01-27 23:39:57,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:57,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-01-27 23:39:57,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-01-27 23:39:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:57,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-27 23:39:57,964 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:57,971 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-27 23:39:57,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-27 23:39:58,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-27 23:39:58,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-27 23:39:58,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-27 23:39:58,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:58,271 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-27 23:39:58,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-27 23:39:58,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-27 23:39:58,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-27 23:39:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-27 23:39:58,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:58,559 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-27 23:39:58,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-27 23:39:58,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-27 23:39:58,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-27 23:39:58,796 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-01-27 23:39:58,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-01-27 23:39:58,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 23:39:58,855 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-27 23:39:58,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-27 23:39:58,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 23:39:58,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-27 23:39:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 905 proven. 112 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-01-27 23:39:58,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 23:47:36,761 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2281 Int) (v_ArrVal_2291 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2278 Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2276)))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2298) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2289) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2281) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|))))))))))))) is different from false [2023-01-27 23:47:40,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2281 Int) (v_ArrVal_2291 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2293 Int) (v_ArrVal_2285 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2278 Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2273)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2276))))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2298) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2281) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2289) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20))))))))))))) is different from false [2023-01-27 23:50:08,559 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268)))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse3 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse2 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2298) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2289) (not (= (select .cse6 .cse1) 20)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2281) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) is different from false [2023-01-27 23:50:14,564 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse3 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2281) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_2289) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2298) (not (= 20 (select .cse6 .cse1))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) is different from false [2023-01-27 23:50:20,679 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1)))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse3 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= (select .cse3 .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2281) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298))))))))))))))) is different from false [2023-01-27 23:50:27,510 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse21 (+ .cse22 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse3 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= (select .cse3 .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2281) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298))))))))))))))) (= .cse22 20)))) is different from false [2023-01-27 23:50:45,274 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2263) .cse21 (+ .cse22 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* 4 (select .cse18 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse5 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse2 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2298) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (not (= 20 (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2281) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))) (= .cse22 20)))) is different from false [2023-01-27 23:51:39,370 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2261 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse21 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2261)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse21 .cse22))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2263) .cse22 (+ .cse4 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse6 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse7 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse0 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2281) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (= .cse4 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2289) (not (= (select .cse6 .cse1) 20)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2298) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)))))))))))))))))) is different from false [2023-01-27 23:52:24,950 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_126| Int) (|v_t1Thread1of1ForFork0_~i~0#1_125| Int) (|v_t1Thread1of1ForFork0_~i~0#1_124| Int) (v_ArrVal_2291 Int) (v_ArrVal_2271 Int) (v_ArrVal_2293 Int) (v_ArrVal_2273 Int) (v_ArrVal_2295 Int) (v_ArrVal_2276 Int) (v_ArrVal_2298 Int) (v_ArrVal_2278 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_2281 Int) (v_ArrVal_2261 Int) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_2263 Int) (v_ArrVal_2285 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| Int) (v_ArrVal_2289 Int) (v_ArrVal_2288 Int) (v_ArrVal_2269 Int) (v_ArrVal_2268 Int) (v_ArrVal_2301 Int) (|v_t1Thread1of1ForFork0_~i~0#1_123| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2261)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse21 .cse1))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_2263) .cse1 (+ .cse8 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2268))))) (let ((.cse9 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2269)))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2271) .cse1 v_ArrVal_2273)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_126| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2276))))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_2278))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_2279) .cse1 v_ArrVal_2281)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_125| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2283))))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2288) .cse1 v_ArrVal_2289)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_124| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2291))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_2293))) (let ((.cse7 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2295) .cse1 v_ArrVal_2298)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_123| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2299))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2298) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2289) (< |v_t1Thread1of1ForFork0_~i~0#1_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_119|) (< 1 v_ArrVal_2273) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |v_t1Thread1of1ForFork0_~i~0#1_125| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2281) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_123|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_2301) .cse1) 20) (= .cse8 20) (< |v_t1Thread1of1ForFork0_~i~0#1_126| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select .cse9 .cse1) 20)) (< |v_t1Thread1of1ForFork0_~i~0#1_125| (+ |v_t1Thread1of1ForFork0_~i~0#1_126| 1)) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|)))))))))))))))))) is different from false Received shutdown request... [2023-01-27 23:53:34,896 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 23:53:34,896 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 23:53:35,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 23:53:36,097 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-27 23:53:36,182 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 137 [2023-01-27 23:53:36,184 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-27 23:53:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 23:53:36,184 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-01-27 23:53:36,185 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-27 23:53:36,185 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-27 23:53:36,185 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-27 23:53:36,185 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-27 23:53:36,186 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2023-01-27 23:53:36,189 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 23:53:36,189 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 23:53:36,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:53:36 BasicIcfg [2023-01-27 23:53:36,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 23:53:36,191 INFO L158 Benchmark]: Toolchain (without parser) took 858453.26ms. Allocated memory was 367.0MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 302.1MB in the beginning and 1.0GB in the end (delta: -747.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.0GB. [2023-01-27 23:53:36,192 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 314.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 23:53:36,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.91ms. Allocated memory was 367.0MB in the beginning and 526.4MB in the end (delta: 159.4MB). Free memory was 301.9MB in the beginning and 481.8MB in the end (delta: -179.9MB). Peak memory consumption was 30.2MB. Max. memory is 16.0GB. [2023-01-27 23:53:36,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.56ms. Allocated memory is still 526.4MB. Free memory was 481.8MB in the beginning and 478.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 23:53:36,192 INFO L158 Benchmark]: Boogie Preprocessor took 61.72ms. Allocated memory is still 526.4MB. Free memory was 478.7MB in the beginning and 476.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 23:53:36,192 INFO L158 Benchmark]: RCFGBuilder took 585.69ms. Allocated memory is still 526.4MB. Free memory was 476.6MB in the beginning and 455.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-27 23:53:36,193 INFO L158 Benchmark]: TraceAbstraction took 857137.83ms. Allocated memory was 526.4MB in the beginning and 1.1GB in the end (delta: 591.4MB). Free memory was 454.6MB in the beginning and 1.0GB in the end (delta: -595.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 23:53:36,194 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.12ms. Allocated memory is still 367.0MB. Free memory is still 314.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 593.91ms. Allocated memory was 367.0MB in the beginning and 526.4MB in the end (delta: 159.4MB). Free memory was 301.9MB in the beginning and 481.8MB in the end (delta: -179.9MB). Peak memory consumption was 30.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.56ms. Allocated memory is still 526.4MB. Free memory was 481.8MB in the beginning and 478.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 61.72ms. Allocated memory is still 526.4MB. Free memory was 478.7MB in the beginning and 476.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 585.69ms. Allocated memory is still 526.4MB. Free memory was 476.6MB in the beginning and 455.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 857137.83ms. Allocated memory was 526.4MB in the beginning and 1.1GB in the end (delta: 591.4MB). Free memory was 454.6MB in the beginning and 1.0GB in the end (delta: -595.3MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 199 PlacesBefore, 47 PlacesAfterwards, 205 TransitionsBefore, 47 TransitionsAfterwards, 9984 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 186 TotalNumberOfCompositions, 19772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9519, independent: 9080, independent conditional: 0, independent unconditional: 9080, dependent: 439, dependent conditional: 0, dependent unconditional: 439, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5401, independent: 5319, independent conditional: 0, independent unconditional: 5319, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9519, independent: 3761, independent conditional: 0, independent unconditional: 3761, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 5401, unknown conditional: 0, unknown unconditional: 5401] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 175 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 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: 856.9s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 734 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2276 IncrementalHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1 mSDtfsCounter, 2276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1044 GetRequests, 909 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1278occurred in iteration=11, InterpolantAutomatonStates: 87, 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.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1746 ConstructedInterpolants, 11 QuantifiedInterpolants, 7463 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3519 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 7318/8804 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 could not prove your program: Timeout Completed graceful shutdown