./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 08:48:27,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 08:48:27,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 08:48:27,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 08:48:27,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 08:48:27,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 08:48:27,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 08:48:27,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 08:48:27,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 08:48:27,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 08:48:27,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 08:48:27,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 08:48:27,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 08:48:27,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 08:48:27,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 08:48:27,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 08:48:27,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 08:48:27,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 08:48:27,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 08:48:27,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 08:48:27,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 08:48:27,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 08:48:27,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 08:48:27,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 08:48:28,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 08:48:28,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 08:48:28,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 08:48:28,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 08:48:28,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 08:48:28,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 08:48:28,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 08:48:28,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 08:48:28,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 08:48:28,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 08:48:28,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 08:48:28,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 08:48:28,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 08:48:28,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 08:48:28,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 08:48:28,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 08:48:28,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 08:48:28,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 08:48:28,036 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 08:48:28,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 08:48:28,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 08:48:28,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 08:48:28,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 08:48:28,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 08:48:28,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 08:48:28,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 08:48:28,038 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 08:48:28,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 08:48:28,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 08:48:28,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 08:48:28,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 08:48:28,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 08:48:28,041 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 08:48:28,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 08:48:28,042 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 08:48:28,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 08:48:28,042 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 08:48:28,042 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 08:48:28,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 08:48:28,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 08:48:28,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 08:48:28,302 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 08:48:28,302 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 08:48:28,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-09-01 08:48:29,207 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 08:48:29,421 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 08:48:29,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-01 08:48:29,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/259e043d2/24afc1fd765240889699e6a16f204611/FLAGb72469635 [2023-09-01 08:48:29,448 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/259e043d2/24afc1fd765240889699e6a16f204611 [2023-09-01 08:48:29,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 08:48:29,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 08:48:29,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 08:48:29,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 08:48:29,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 08:48:29,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:29,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3824b38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29, skipping insertion in model container [2023-09-01 08:48:29,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:29,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 08:48:29,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 08:48:29,855 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-09-01 08:48:29,861 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-09-01 08:48:29,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 08:48:29,875 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 08:48:29,908 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-09-01 08:48:29,914 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-09-01 08:48:29,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 08:48:29,969 INFO L208 MainTranslator]: Completed translation [2023-09-01 08:48:29,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29 WrapperNode [2023-09-01 08:48:29,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 08:48:29,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 08:48:29,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 08:48:29,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 08:48:29,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,026 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-01 08:48:30,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 08:48:30,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 08:48:30,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 08:48:30,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 08:48:30,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,065 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 08:48:30,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 08:48:30,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 08:48:30,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 08:48:30,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (1/1) ... [2023-09-01 08:48:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 08:48:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:30,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 08:48:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 08:48:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 08:48:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 08:48:30,125 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 08:48:30,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 08:48:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 08:48:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 08:48:30,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 08:48:30,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 08:48:30,127 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 08:48:30,255 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 08:48:30,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 08:48:30,525 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 08:48:30,530 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 08:48:30,531 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 08:48:30,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 08:48:30 BoogieIcfgContainer [2023-09-01 08:48:30,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 08:48:30,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 08:48:30,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 08:48:30,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 08:48:30,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 08:48:29" (1/3) ... [2023-09-01 08:48:30,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5e0a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 08:48:30, skipping insertion in model container [2023-09-01 08:48:30,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:48:29" (2/3) ... [2023-09-01 08:48:30,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5e0a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 08:48:30, skipping insertion in model container [2023-09-01 08:48:30,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 08:48:30" (3/3) ... [2023-09-01 08:48:30,538 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-01 08:48:30,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 08:48:30,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 08:48:30,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 08:48:30,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 08:48:30,639 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 08:48:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-09-01 08:48:30,736 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-09-01 08:48:30,737 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 08:48:30,743 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-09-01 08:48:30,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-09-01 08:48:30,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-09-01 08:48:30,753 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 08:48:30,761 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-09-01 08:48:30,766 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-09-01 08:48:30,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-09-01 08:48:30,820 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-09-01 08:48:30,820 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 08:48:30,824 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-09-01 08:48:30,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-09-01 08:48:35,967 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-09-01 08:48:35,968 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-09-01 08:48:35,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 08:48:35,981 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a6100b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 08:48:35,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 08:48:35,982 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 08:48:35,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 08:48:35,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:35,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 08:48:35,984 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-09-01 08:48:35,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-09-01 08:48:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140300963] [2023-09-01 08:48:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:36,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140300963] [2023-09-01 08:48:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140300963] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:48:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 08:48:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081914204] [2023-09-01 08:48:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 08:48:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 08:48:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 08:48:36,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-09-01 08:48:36,163 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-09-01 08:48:36,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:36,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-09-01 08:48:36,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:36,315 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-09-01 08:48:36,316 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-09-01 08:48:36,317 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-09-01 08:48:36,321 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-09-01 08:48:36,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-09-01 08:48:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 08:48:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 08:48:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-09-01 08:48:36,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-09-01 08:48:36,331 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-09-01 08:48:36,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-09-01 08:48:36,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:36,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-09-01 08:48:36,337 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-09-01 08:48:36,340 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-09-01 08:48:36,340 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-09-01 08:48:36,342 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-09-01 08:48:36,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-09-01 08:48:36,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 08:48:36,345 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-09-01 08:48:36,346 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-09-01 08:48:36,348 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-09-01 08:48:36,348 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-09-01 08:48:36,349 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-09-01 08:48:36,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:36,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:48:36,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 08:48:36,349 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-09-01 08:48:36,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-09-01 08:48:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474182869] [2023-09-01 08:48:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:36,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474182869] [2023-09-01 08:48:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474182869] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:36,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:48:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 08:48:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884733582] [2023-09-01 08:48:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:36,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:48:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:48:36,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:48:36,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:48:36,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:36,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:48:36,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:36,610 INFO L130 PetriNetUnfolder]: 197/403 cut-off events. [2023-09-01 08:48:36,611 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 08:48:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 403 events. 197/403 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1584 event pairs, 125 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 808. Up to 193 conditions per place. [2023-09-01 08:48:36,612 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 5/52 dead transitions. [2023-09-01 08:48:36,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 203 flow [2023-09-01 08:48:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:48:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:48:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2023-09-01 08:48:36,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364842454394693 [2023-09-01 08:48:36,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2023-09-01 08:48:36,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2023-09-01 08:48:36,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:36,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2023-09-01 08:48:36,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,621 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-09-01 08:48:36,621 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-09-01 08:48:36,621 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 647 transitions. [2023-09-01 08:48:36,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 203 flow [2023-09-01 08:48:36,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 08:48:36,623 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 98 flow [2023-09-01 08:48:36,623 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=98, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-09-01 08:48:36,623 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-09-01 08:48:36,624 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 98 flow [2023-09-01 08:48:36,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:36,624 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-09-01 08:48:36,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 08:48:36,625 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-09-01 08:48:36,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-09-01 08:48:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68675318] [2023-09-01 08:48:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:36,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68675318] [2023-09-01 08:48:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68675318] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:36,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:48:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 08:48:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843419753] [2023-09-01 08:48:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:48:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:48:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:48:36,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 402 [2023-09-01 08:48:36,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:36,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 402 [2023-09-01 08:48:36,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:36,755 INFO L130 PetriNetUnfolder]: 245/498 cut-off events. [2023-09-01 08:48:36,756 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 08:48:36,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 498 events. 245/498 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1823 event pairs, 155 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 1028. Up to 357 conditions per place. [2023-09-01 08:48:36,758 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-09-01 08:48:36,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 230 flow [2023-09-01 08:48:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:48:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:48:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2023-09-01 08:48:36,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543117744610282 [2023-09-01 08:48:36,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2023-09-01 08:48:36,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2023-09-01 08:48:36,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:36,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2023-09-01 08:48:36,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,772 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-09-01 08:48:36,772 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-09-01 08:48:36,773 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 98 flow. Second operand 3 states and 655 transitions. [2023-09-01 08:48:36,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 230 flow [2023-09-01 08:48:36,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 08:48:36,774 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 113 flow [2023-09-01 08:48:36,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-09-01 08:48:36,775 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-09-01 08:48:36,775 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 113 flow [2023-09-01 08:48:36,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:36,776 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-09-01 08:48:36,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 08:48:36,776 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-09-01 08:48:36,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-09-01 08:48:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:36,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881270323] [2023-09-01 08:48:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881270323] [2023-09-01 08:48:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881270323] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:36,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:48:36,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 08:48:36,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566730654] [2023-09-01 08:48:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:36,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:48:36,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:48:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:48:36,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-09-01 08:48:36,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:36,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:36,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-09-01 08:48:36,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:37,010 INFO L130 PetriNetUnfolder]: 230/513 cut-off events. [2023-09-01 08:48:37,010 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-09-01 08:48:37,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 513 events. 230/513 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2000 event pairs, 29 based on Foata normal form. 42/525 useless extension candidates. Maximal degree in co-relation 1099. Up to 407 conditions per place. [2023-09-01 08:48:37,012 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 43 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-09-01 08:48:37,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 222 flow [2023-09-01 08:48:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:48:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:48:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-09-01 08:48:37,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339966832504146 [2023-09-01 08:48:37,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-09-01 08:48:37,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-09-01 08:48:37,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:37,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-09-01 08:48:37,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:37,022 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-09-01 08:48:37,023 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-09-01 08:48:37,023 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 113 flow. Second operand 3 states and 644 transitions. [2023-09-01 08:48:37,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 222 flow [2023-09-01 08:48:37,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 08:48:37,025 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 114 flow [2023-09-01 08:48:37,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-09-01 08:48:37,027 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-09-01 08:48:37,027 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 114 flow [2023-09-01 08:48:37,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:37,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:37,028 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-09-01 08:48:37,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 08:48:37,028 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-09-01 08:48:37,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-09-01 08:48:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800930340] [2023-09-01 08:48:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800930340] [2023-09-01 08:48:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800930340] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195487779] [2023-09-01 08:48:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:37,103 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-09-01 08:48:37,106 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-09-01 08:48:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:37,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 08:48:37,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:37,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:48:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195487779] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:48:37,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:48:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 08:48:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410341034] [2023-09-01 08:48:37,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:48:37,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 08:48:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 08:48:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 08:48:37,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:48:37,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 205.57142857142858) internal successors, (1439), 7 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:37,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:37,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:48:37,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:37,455 INFO L130 PetriNetUnfolder]: 246/536 cut-off events. [2023-09-01 08:48:37,455 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-09-01 08:48:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 536 events. 246/536 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1552 event pairs, 100 based on Foata normal form. 12/512 useless extension candidates. Maximal degree in co-relation 1199. Up to 238 conditions per place. [2023-09-01 08:48:37,457 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2023-09-01 08:48:37,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 372 flow [2023-09-01 08:48:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 08:48:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 08:48:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2023-09-01 08:48:37,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319237147595357 [2023-09-01 08:48:37,460 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1283 transitions. [2023-09-01 08:48:37,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1283 transitions. [2023-09-01 08:48:37,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:37,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1283 transitions. [2023-09-01 08:48:37,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.83333333333334) internal successors, (1283), 6 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:37,465 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-09-01 08:48:37,466 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-09-01 08:48:37,466 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 114 flow. Second operand 6 states and 1283 transitions. [2023-09-01 08:48:37,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 372 flow [2023-09-01 08:48:37,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 08:48:37,468 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 172 flow [2023-09-01 08:48:37,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-09-01 08:48:37,469 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-09-01 08:48:37,469 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 172 flow [2023-09-01 08:48:37,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 205.57142857142858) internal successors, (1439), 7 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:37,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:37,470 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-09-01 08:48:37,479 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-09-01 08:48:37,676 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-09-01 08:48:37,676 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-09-01 08:48:37,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-09-01 08:48:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026422580] [2023-09-01 08:48:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026422580] [2023-09-01 08:48:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026422580] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182143363] [2023-09-01 08:48:37,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 08:48:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:37,810 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-09-01 08:48:37,812 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-09-01 08:48:37,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 08:48:37,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:48:37,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 08:48:37,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:38,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:48:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182143363] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:48:38,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:48:38,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-09-01 08:48:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122024274] [2023-09-01 08:48:38,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:48:38,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 08:48:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 08:48:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-09-01 08:48:38,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:48:38,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 205.84615384615384) internal successors, (2676), 13 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:38,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:38,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:48:38,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:38,408 INFO L130 PetriNetUnfolder]: 423/937 cut-off events. [2023-09-01 08:48:38,409 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-09-01 08:48:38,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 937 events. 423/937 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2594 event pairs, 91 based on Foata normal form. 24/903 useless extension candidates. Maximal degree in co-relation 2360. Up to 217 conditions per place. [2023-09-01 08:48:38,413 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2023-09-01 08:48:38,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 838 flow [2023-09-01 08:48:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 08:48:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 08:48:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2564 transitions. [2023-09-01 08:48:38,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315091210613598 [2023-09-01 08:48:38,421 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2564 transitions. [2023-09-01 08:48:38,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2564 transitions. [2023-09-01 08:48:38,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:38,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2564 transitions. [2023-09-01 08:48:38,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.66666666666666) internal successors, (2564), 12 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:38,436 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-09-01 08:48:38,437 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-09-01 08:48:38,437 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 172 flow. Second operand 12 states and 2564 transitions. [2023-09-01 08:48:38,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 838 flow [2023-09-01 08:48:38,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 799 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-09-01 08:48:38,447 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 322 flow [2023-09-01 08:48:38,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-09-01 08:48:38,450 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-09-01 08:48:38,450 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 322 flow [2023-09-01 08:48:38,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 205.84615384615384) internal successors, (2676), 13 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:38,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:38,452 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-09-01 08:48:38,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 08:48:38,689 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-09-01 08:48:38,689 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-09-01 08:48:38,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-09-01 08:48:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867842253] [2023-09-01 08:48:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867842253] [2023-09-01 08:48:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867842253] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234232374] [2023-09-01 08:48:39,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 08:48:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:39,069 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-09-01 08:48:39,076 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-09-01 08:48:39,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-01 08:48:39,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:48:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 70 conjunts are in the unsatisfiable core [2023-09-01 08:48:39,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:39,861 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-09-01 08:48:39,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:39,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 14 treesize of output 16 [2023-09-01 08:48:39,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:39,927 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-09-01 08:48:39,991 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-09-01 08:48:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-09-01 08:48:39,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 08:48:39,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234232374] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:39,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 08:48:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-09-01 08:48:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990787797] [2023-09-01 08:48:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 08:48:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 08:48:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-09-01 08:48:40,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 402 [2023-09-01 08:48:40,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:40,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:40,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 402 [2023-09-01 08:48:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:40,392 INFO L130 PetriNetUnfolder]: 725/1591 cut-off events. [2023-09-01 08:48:40,393 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2023-09-01 08:48:40,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 1591 events. 725/1591 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5587 event pairs, 159 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 4244. Up to 992 conditions per place. [2023-09-01 08:48:40,398 INFO L137 encePairwiseOnDemand]: 394/402 looper letters, 89 selfloop transitions, 11 changer transitions 1/104 dead transitions. [2023-09-01 08:48:40,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 732 flow [2023-09-01 08:48:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 08:48:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 08:48:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2023-09-01 08:48:40,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995854063018242 [2023-09-01 08:48:40,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1205 transitions. [2023-09-01 08:48:40,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1205 transitions. [2023-09-01 08:48:40,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:40,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1205 transitions. [2023-09-01 08:48:40,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:40,406 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-09-01 08:48:40,406 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-09-01 08:48:40,407 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 322 flow. Second operand 6 states and 1205 transitions. [2023-09-01 08:48:40,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 732 flow [2023-09-01 08:48:40,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 716 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 08:48:40,411 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 400 flow [2023-09-01 08:48:40,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-09-01 08:48:40,411 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2023-09-01 08:48:40,412 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 400 flow [2023-09-01 08:48:40,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:40,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:40,412 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-09-01 08:48:40,420 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-09-01 08:48:40,618 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-09-01 08:48:40,619 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-09-01 08:48:40,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -345088948, now seen corresponding path program 1 times [2023-09-01 08:48:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730597535] [2023-09-01 08:48:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730597535] [2023-09-01 08:48:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730597535] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343175229] [2023-09-01 08:48:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:40,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:40,907 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-09-01 08:48:40,909 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-09-01 08:48:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 08:48:41,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:41,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:48:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:48:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343175229] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:48:41,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:48:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-09-01 08:48:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074341354] [2023-09-01 08:48:41,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:48:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-09-01 08:48:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-09-01 08:48:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-09-01 08:48:41,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:48:41,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 400 flow. Second operand has 23 states, 23 states have (on average 206.56521739130434) internal successors, (4751), 23 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:41,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:41,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:48:41,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:41,915 INFO L130 PetriNetUnfolder]: 1178/2750 cut-off events. [2023-09-01 08:48:41,915 INFO L131 PetriNetUnfolder]: For 4953/4953 co-relation queries the response was YES. [2023-09-01 08:48:41,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8937 conditions, 2750 events. 1178/2750 cut-off events. For 4953/4953 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 9921 event pairs, 137 based on Foata normal form. 80/2806 useless extension candidates. Maximal degree in co-relation 8917. Up to 680 conditions per place. [2023-09-01 08:48:41,927 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 344 selfloop transitions, 43 changer transitions 0/391 dead transitions. [2023-09-01 08:48:41,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 391 transitions, 2837 flow [2023-09-01 08:48:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-09-01 08:48:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-09-01 08:48:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4698 transitions. [2023-09-01 08:48:41,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312075983717774 [2023-09-01 08:48:41,934 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4698 transitions. [2023-09-01 08:48:41,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4698 transitions. [2023-09-01 08:48:41,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:41,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4698 transitions. [2023-09-01 08:48:41,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 213.54545454545453) internal successors, (4698), 22 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:41,951 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-09-01 08:48:41,952 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-09-01 08:48:41,952 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 400 flow. Second operand 22 states and 4698 transitions. [2023-09-01 08:48:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 391 transitions, 2837 flow [2023-09-01 08:48:41,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 391 transitions, 2836 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 08:48:41,961 INFO L231 Difference]: Finished difference. Result has 106 places, 92 transitions, 782 flow [2023-09-01 08:48:41,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=782, PETRI_PLACES=106, PETRI_TRANSITIONS=92} [2023-09-01 08:48:41,962 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-09-01 08:48:41,962 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 782 flow [2023-09-01 08:48:41,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 206.56521739130434) internal successors, (4751), 23 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:41,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:41,964 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-09-01 08:48:41,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 08:48:42,169 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-09-01 08:48:42,170 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-09-01 08:48:42,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash -541637280, now seen corresponding path program 2 times [2023-09-01 08:48:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47353160] [2023-09-01 08:48:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2023-09-01 08:48:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47353160] [2023-09-01 08:48:43,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47353160] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:43,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:48:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 08:48:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829302949] [2023-09-01 08:48:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 08:48:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 08:48:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 08:48:43,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 402 [2023-09-01 08:48:43,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 782 flow. Second operand has 5 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:43,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:43,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 402 [2023-09-01 08:48:43,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:44,460 INFO L130 PetriNetUnfolder]: 1283/2843 cut-off events. [2023-09-01 08:48:44,460 INFO L131 PetriNetUnfolder]: For 4916/4916 co-relation queries the response was YES. [2023-09-01 08:48:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9918 conditions, 2843 events. 1283/2843 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10010 event pairs, 797 based on Foata normal form. 1/2820 useless extension candidates. Maximal degree in co-relation 9888. Up to 2813 conditions per place. [2023-09-01 08:48:44,473 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 93 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2023-09-01 08:48:44,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 1046 flow [2023-09-01 08:48:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 08:48:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 08:48:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2023-09-01 08:48:44,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494195688225539 [2023-09-01 08:48:44,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1192 transitions. [2023-09-01 08:48:44,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1192 transitions. [2023-09-01 08:48:44,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:44,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1192 transitions. [2023-09-01 08:48:44,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:44,487 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-09-01 08:48:44,488 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-09-01 08:48:44,488 INFO L175 Difference]: Start difference. First operand has 106 places, 92 transitions, 782 flow. Second operand 6 states and 1192 transitions. [2023-09-01 08:48:44,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 1046 flow [2023-09-01 08:48:44,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 1010 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-09-01 08:48:44,505 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 829 flow [2023-09-01 08:48:44,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-09-01 08:48:44,506 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-09-01 08:48:44,506 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 829 flow [2023-09-01 08:48:44,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:44,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:44,507 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-09-01 08:48:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 08:48:44,509 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-09-01 08:48:44,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash -49729782, now seen corresponding path program 3 times [2023-09-01 08:48:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:44,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418499473] [2023-09-01 08:48:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 613 proven. 53 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2023-09-01 08:48:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418499473] [2023-09-01 08:48:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418499473] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443180397] [2023-09-01 08:48:46,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 08:48:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:46,890 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-09-01 08:48:46,892 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-09-01 08:48:48,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-09-01 08:48:48,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:48:48,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 135 conjunts are in the unsatisfiable core [2023-09-01 08:48:48,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:48,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:48,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:48,535 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-09-01 08:48:48,569 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-09-01 08:48:48,569 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-09-01 08:48:48,582 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-09-01 08:48:48,680 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-09-01 08:48:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:48,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:48,744 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-09-01 08:48:48,798 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-09-01 08:48:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2023-09-01 08:48:48,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 08:48:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443180397] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:48:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 08:48:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2023-09-01 08:48:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81669632] [2023-09-01 08:48:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:48:48,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 08:48:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 08:48:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-09-01 08:48:49,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 402 [2023-09-01 08:48:49,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 829 flow. Second operand has 7 states, 7 states have (on average 192.85714285714286) internal successors, (1350), 7 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:49,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:49,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 402 [2023-09-01 08:48:49,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:49,510 INFO L130 PetriNetUnfolder]: 1289/2862 cut-off events. [2023-09-01 08:48:49,511 INFO L131 PetriNetUnfolder]: For 5300/5300 co-relation queries the response was YES. [2023-09-01 08:48:49,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10477 conditions, 2862 events. 1289/2862 cut-off events. For 5300/5300 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 10425 event pairs, 434 based on Foata normal form. 3/2841 useless extension candidates. Maximal degree in co-relation 10442. Up to 2777 conditions per place. [2023-09-01 08:48:49,526 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 103 selfloop transitions, 9 changer transitions 1/116 dead transitions. [2023-09-01 08:48:49,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 1113 flow [2023-09-01 08:48:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 08:48:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 08:48:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2023-09-01 08:48:49,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49212271973466004 [2023-09-01 08:48:49,529 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1187 transitions. [2023-09-01 08:48:49,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1187 transitions. [2023-09-01 08:48:49,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:49,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1187 transitions. [2023-09-01 08:48:49,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:49,533 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-09-01 08:48:49,533 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-09-01 08:48:49,533 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 829 flow. Second operand 6 states and 1187 transitions. [2023-09-01 08:48:49,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 1113 flow [2023-09-01 08:48:49,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 1089 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-09-01 08:48:49,550 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 867 flow [2023-09-01 08:48:49,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2023-09-01 08:48:49,550 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2023-09-01 08:48:49,550 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 867 flow [2023-09-01 08:48:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 192.85714285714286) internal successors, (1350), 7 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:48:49,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:49,551 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-09-01 08:48:49,558 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-09-01 08:48:49,758 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-09-01 08:48:49,760 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-09-01 08:48:49,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1311907394, now seen corresponding path program 4 times [2023-09-01 08:48:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:49,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095176248] [2023-09-01 08:48:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2023-09-01 08:48:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095176248] [2023-09-01 08:48:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095176248] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389467986] [2023-09-01 08:48:51,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 08:48:51,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:51,643 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-09-01 08:48:51,645 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-09-01 08:48:52,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 08:48:52,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:48:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 55 conjunts are in the unsatisfiable core [2023-09-01 08:48:52,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:48:52,382 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-09-01 08:48:52,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:52,403 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-09-01 08:48:52,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:52,451 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-09-01 08:48:52,495 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-09-01 08:48:52,551 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-09-01 08:48:52,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:52,575 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-09-01 08:48:52,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:48:52,617 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-09-01 08:48:52,644 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-09-01 08:48:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 665 proven. 35 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-09-01 08:48:52,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:48:52,729 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-09-01 08:48:52,755 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-09-01 08:48:52,781 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-09-01 08:48:52,803 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-09-01 08:48:52,838 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-09-01 08:48:52,918 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1835))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1837))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1838) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1842) |c_~#queue~0.base|))) (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)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|)))))) is different from false [2023-09-01 08:48:52,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:48:52,935 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-09-01 08:48:52,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:48:52,945 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-09-01 08:48:52,956 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-09-01 08:48:52,962 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-09-01 08:48:52,979 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-09-01 08:48:53,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:48:53,057 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-09-01 08:48:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 630 proven. 31 refuted. 0 times theorem prover too weak. 495 trivial. 39 not checked. [2023-09-01 08:48:53,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389467986] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:48:53,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:48:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-09-01 08:48:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227905831] [2023-09-01 08:48:53,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:48:53,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-01 08:48:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:48:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-01 08:48:53,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=574, Unknown=6, NotChecked=342, Total=1122 [2023-09-01 08:48:53,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 402 [2023-09-01 08:48:53,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 867 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-09-01 08:48:53,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:48:53,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 402 [2023-09-01 08:48:53,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:48:54,771 INFO L130 PetriNetUnfolder]: 2349/5349 cut-off events. [2023-09-01 08:48:54,771 INFO L131 PetriNetUnfolder]: For 11791/11791 co-relation queries the response was YES. [2023-09-01 08:48:54,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20452 conditions, 5349 events. 2349/5349 cut-off events. For 11791/11791 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 24756 event pairs, 161 based on Foata normal form. 137/5450 useless extension candidates. Maximal degree in co-relation 20413. Up to 1994 conditions per place. [2023-09-01 08:48:54,798 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 206 selfloop transitions, 52 changer transitions 1/262 dead transitions. [2023-09-01 08:48:54,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 262 transitions, 2608 flow [2023-09-01 08:48:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 08:48:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 08:48:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2943 transitions. [2023-09-01 08:48:54,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2023-09-01 08:48:54,804 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2943 transitions. [2023-09-01 08:48:54,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2943 transitions. [2023-09-01 08:48:54,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:48:54,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2943 transitions. [2023-09-01 08:48:54,809 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-09-01 08:48:54,814 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-09-01 08:48:54,815 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-09-01 08:48:54,815 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 867 flow. Second operand 18 states and 2943 transitions. [2023-09-01 08:48:54,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 262 transitions, 2608 flow [2023-09-01 08:48:54,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 262 transitions, 2590 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 08:48:54,858 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 1280 flow [2023-09-01 08:48:54,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1280, PETRI_PLACES=135, PETRI_TRANSITIONS=135} [2023-09-01 08:48:54,859 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 88 predicate places. [2023-09-01 08:48:54,859 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 135 transitions, 1280 flow [2023-09-01 08:48:54,860 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-09-01 08:48:54,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:48:54,860 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-09-01 08:48:54,873 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-09-01 08:48:55,069 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-09-01 08:48:55,069 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-09-01 08:48:55,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:48:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 259927122, now seen corresponding path program 5 times [2023-09-01 08:48:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:48:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614501145] [2023-09-01 08:48:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:48:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:48:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:48:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 678 proven. 60 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2023-09-01 08:48:58,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:48:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614501145] [2023-09-01 08:48:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614501145] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:48:58,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583681317] [2023-09-01 08:48:58,041 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 08:48:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:48:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:48:58,042 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-09-01 08:48:58,044 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-09-01 08:49:01,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-09-01 08:49:01,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:49:01,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 199 conjunts are in the unsatisfiable core [2023-09-01 08:49:01,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:49:01,932 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-09-01 08:49:01,956 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:49:01,956 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-09-01 08:49:02,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:02,077 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-09-01 08:49:02,077 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-09-01 08:49:02,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:02,148 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-09-01 08:49:02,263 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-09-01 08:49:02,311 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:49:02,312 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-09-01 08:49:02,407 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:02,415 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-09-01 08:49:02,415 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-09-01 08:49:02,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:02,472 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-09-01 08:49:02,581 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-09-01 08:49:02,636 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:49:02,636 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-09-01 08:49:02,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:02,776 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-09-01 08:49:02,777 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-09-01 08:49:02,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:02,863 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-09-01 08:49:03,001 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-09-01 08:49:03,058 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:49:03,061 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-09-01 08:49:03,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:03,206 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-09-01 08:49:03,206 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-09-01 08:49:03,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,289 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-09-01 08:49:03,342 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-09-01 08:49:03,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,369 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-09-01 08:49:03,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:03,444 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:49:03,444 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-09-01 08:49:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,499 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-09-01 08:49:03,569 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-09-01 08:49:03,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,598 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-09-01 08:49:03,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:03,682 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:49:03,682 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-09-01 08:49:03,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,739 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-09-01 08:49:03,808 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-09-01 08:49:03,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:03,853 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-09-01 08:49:03,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:03,948 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:49:03,949 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-09-01 08:49:04,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:04,007 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-09-01 08:49:04,082 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-09-01 08:49:04,126 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-09-01 08:49:04,126 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-09-01 08:49:04,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:49:04,170 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:49:04,170 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-09-01 08:49:04,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:49:04,206 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-09-01 08:49:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 905 proven. 112 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-09-01 08:49:04,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:54:45,754 WARN L839 $PredicateComparison]: unable to prove that (forall ((|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_2298 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 ((.cse5 (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_2278)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2279) .cse6 v_ArrVal_2281)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2283))))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_2285)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (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 ((.cse7 (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 .cse7 .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_123| (+ |v_t1Thread1of1ForFork0_~i~0#1_124| 1)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< |v_t1Thread1of1ForFork0_~i~0#1_124| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2289) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2281) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2298) (< (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-09-01 08:56:54,791 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-09-01 08:59:15,031 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-09-01 08:59:20,727 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-09-01 08:59:26,659 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-09-01 08:59:32,471 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-09-01 08:59:48,681 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-09-01 09:00:42,352 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-09-01 09:01:29,396 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 Killed by 15