./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 TOGETHER --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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 22:36:18,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 22:36:18,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 22:36:18,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 22:36:18,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 22:36:18,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 22:36:18,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 22:36:18,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 22:36:18,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 22:36:18,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 22:36:18,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 22:36:18,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 22:36:18,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 22:36:18,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 22:36:18,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 22:36:18,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 22:36:18,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 22:36:18,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 22:36:18,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 22:36:18,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 22:36:18,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 22:36:18,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 22:36:18,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 22:36:18,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 22:36:18,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 22:36:18,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 22:36:18,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 22:36:18,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 22:36:18,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 22:36:18,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 22:36:18,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 22:36:18,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 22:36:18,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 22:36:18,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 22:36:18,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 22:36:18,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 22:36:18,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 22:36:18,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 22:36:18,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 22:36:18,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 22:36:18,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 22:36:18,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 22:36:18,504 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 22:36:18,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 22:36:18,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 22:36:18,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 22:36:18,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 22:36:18,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 22:36:18,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 22:36:18,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 22:36:18,507 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 22:36:18,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 22:36:18,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 22:36:18,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 22:36:18,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 22:36:18,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 22:36:18,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 22:36:18,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 22:36:18,511 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 22:36:18,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 22:36:18,511 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 22:36:18,511 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 -> TOGETHER [2023-08-30 22:36:18,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 22:36:18,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 22:36:18,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 22:36:18,739 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 22:36:18,739 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 22:36:18,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 22:36:19,637 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 22:36:19,845 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 22:36:19,846 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 22:36:19,860 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b4ce16f/a8b3276babd44fd38dab70daeb34174d/FLAGea7ece88d [2023-08-30 22:36:19,873 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b4ce16f/a8b3276babd44fd38dab70daeb34174d [2023-08-30 22:36:19,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 22:36:19,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 22:36:19,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 22:36:19,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 22:36:19,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 22:36:19,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:36:19" (1/1) ... [2023-08-30 22:36:19,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be3711e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:19, skipping insertion in model container [2023-08-30 22:36:19,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:36:19" (1/1) ... [2023-08-30 22:36:19,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 22:36:19,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 22:36:20,188 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-08-30 22:36:20,193 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-08-30 22:36:20,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 22:36:20,211 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 22:36:20,244 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-08-30 22:36:20,250 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-08-30 22:36:20,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 22:36:20,305 INFO L208 MainTranslator]: Completed translation [2023-08-30 22:36:20,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20 WrapperNode [2023-08-30 22:36:20,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 22:36:20,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 22:36:20,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 22:36:20,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 22:36:20,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,357 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-30 22:36:20,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 22:36:20,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 22:36:20,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 22:36:20,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 22:36:20,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 22:36:20,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 22:36:20,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 22:36:20,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 22:36:20,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (1/1) ... [2023-08-30 22:36:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 22:36:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:20,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 22:36:20,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 22:36:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 22:36:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 22:36:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 22:36:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 22:36:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 22:36:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 22:36:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 22:36:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 22:36:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 22:36:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 22:36:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 22:36:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 22:36:20,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 22:36:20,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 22:36:20,606 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 22:36:20,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 22:36:20,850 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 22:36:20,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 22:36:20,861 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 22:36:20,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:36:20 BoogieIcfgContainer [2023-08-30 22:36:20,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 22:36:20,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 22:36:20,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 22:36:20,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 22:36:20,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:36:19" (1/3) ... [2023-08-30 22:36:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b403e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:36:20, skipping insertion in model container [2023-08-30 22:36:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:36:20" (2/3) ... [2023-08-30 22:36:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b403e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:36:20, skipping insertion in model container [2023-08-30 22:36:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:36:20" (3/3) ... [2023-08-30 22:36:20,869 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-30 22:36:20,874 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 22:36:20,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 22:36:20,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 22:36:20,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 22:36:20,982 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 22:36:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-08-30 22:36:21,092 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-08-30 22:36:21,093 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 22:36:21,098 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-08-30 22:36:21,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-08-30 22:36:21,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-08-30 22:36:21,107 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 22:36:21,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-30 22:36:21,114 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-30 22:36:21,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-08-30 22:36:21,139 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-08-30 22:36:21,139 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 22:36:21,140 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-08-30 22:36:21,144 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-08-30 22:36:26,245 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-08-30 22:36:26,245 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-30 22:36:26,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 22:36:26,257 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;@67881bf3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 22:36:26,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 22:36:26,258 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 22:36:26,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 22:36:26,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:26,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 22:36:26,259 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-08-30 22:36:26,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-08-30 22:36:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605845979] [2023-08-30 22:36:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605845979] [2023-08-30 22:36:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605845979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:36:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 22:36:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902033652] [2023-08-30 22:36:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:26,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 22:36:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 22:36:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 22:36:26,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-08-30 22:36:26,363 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-08-30 22:36:26,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:26,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-08-30 22:36:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:26,488 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-08-30 22:36:26,488 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 22:36:26,490 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-08-30 22:36:26,494 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-08-30 22:36:26,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-08-30 22:36:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 22:36:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 22:36:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-08-30 22:36:26,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-08-30 22:36:26,504 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-08-30 22:36:26,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-08-30 22:36:26,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:26,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-08-30 22:36:26,509 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-08-30 22:36:26,512 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-08-30 22:36:26,513 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-08-30 22:36:26,514 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-08-30 22:36:26,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-08-30 22:36:26,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 22:36:26,517 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-08-30 22:36:26,518 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-08-30 22:36:26,520 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-30 22:36:26,520 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-08-30 22:36:26,521 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-08-30 22:36:26,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:26,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:36:26,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 22:36:26,521 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-08-30 22:36:26,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-08-30 22:36:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650021113] [2023-08-30 22:36:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:26,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:26,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650021113] [2023-08-30 22:36:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650021113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:36:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 22:36:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923996408] [2023-08-30 22:36:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 22:36:26,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:26,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 22:36:26,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 22:36:26,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 22:36:26,772 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-08-30 22:36:26,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:26,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 22:36:26,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:26,841 INFO L130 PetriNetUnfolder]: 197/403 cut-off events. [2023-08-30 22:36:26,841 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-30 22:36:26,842 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-08-30 22:36:26,843 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 5/52 dead transitions. [2023-08-30 22:36:26,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 203 flow [2023-08-30 22:36:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 22:36:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 22:36:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2023-08-30 22:36:26,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364842454394693 [2023-08-30 22:36:26,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2023-08-30 22:36:26,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2023-08-30 22:36:26,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:26,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2023-08-30 22:36:26,850 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-08-30 22:36:26,852 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-08-30 22:36:26,853 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-08-30 22:36:26,853 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 647 transitions. [2023-08-30 22:36:26,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 203 flow [2023-08-30 22:36:26,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 22:36:26,854 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 98 flow [2023-08-30 22:36:26,855 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-08-30 22:36:26,855 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-30 22:36:26,856 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 98 flow [2023-08-30 22:36:26,856 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-08-30 22:36:26,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:26,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 22:36:26,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 22:36:26,857 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-08-30 22:36:26,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-08-30 22:36:26,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:26,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958094906] [2023-08-30 22:36:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958094906] [2023-08-30 22:36:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958094906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:36:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 22:36:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287878725] [2023-08-30 22:36:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:26,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 22:36:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 22:36:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 22:36:26,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 402 [2023-08-30 22:36:26,936 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-08-30 22:36:26,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:26,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 402 [2023-08-30 22:36:26,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:27,029 INFO L130 PetriNetUnfolder]: 245/498 cut-off events. [2023-08-30 22:36:27,030 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 22:36:27,031 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-08-30 22:36:27,032 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-30 22:36:27,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 230 flow [2023-08-30 22:36:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 22:36:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 22:36:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2023-08-30 22:36:27,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543117744610282 [2023-08-30 22:36:27,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2023-08-30 22:36:27,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2023-08-30 22:36:27,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:27,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2023-08-30 22:36:27,036 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-08-30 22:36:27,037 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-08-30 22:36:27,038 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-08-30 22:36:27,038 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 98 flow. Second operand 3 states and 655 transitions. [2023-08-30 22:36:27,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 230 flow [2023-08-30 22:36:27,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 22:36:27,039 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 113 flow [2023-08-30 22:36:27,039 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-08-30 22:36:27,040 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-30 22:36:27,040 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 113 flow [2023-08-30 22:36:27,041 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-08-30 22:36:27,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:27,041 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-08-30 22:36:27,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 22:36:27,041 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-08-30 22:36:27,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-08-30 22:36:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265705974] [2023-08-30 22:36:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265705974] [2023-08-30 22:36:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265705974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:27,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:36:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 22:36:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105982561] [2023-08-30 22:36:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:27,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 22:36:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 22:36:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 22:36:27,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-08-30 22:36:27,144 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-08-30 22:36:27,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:27,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-08-30 22:36:27,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:27,203 INFO L130 PetriNetUnfolder]: 230/513 cut-off events. [2023-08-30 22:36:27,203 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 22:36:27,204 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-08-30 22:36:27,205 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 43 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-30 22:36:27,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 222 flow [2023-08-30 22:36:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 22:36:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 22:36:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-30 22:36:27,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339966832504146 [2023-08-30 22:36:27,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-30 22:36:27,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-30 22:36:27,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:27,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-30 22:36:27,208 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-08-30 22:36:27,210 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-08-30 22:36:27,210 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-08-30 22:36:27,210 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 113 flow. Second operand 3 states and 644 transitions. [2023-08-30 22:36:27,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 222 flow [2023-08-30 22:36:27,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 22:36:27,212 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 114 flow [2023-08-30 22:36:27,212 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-08-30 22:36:27,213 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-08-30 22:36:27,213 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 114 flow [2023-08-30 22:36:27,213 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-08-30 22:36:27,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:27,214 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-08-30 22:36:27,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 22:36:27,214 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-08-30 22:36:27,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-08-30 22:36:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26182500] [2023-08-30 22:36:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26182500] [2023-08-30 22:36:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26182500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347546089] [2023-08-30 22:36:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:27,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:27,265 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-08-30 22:36:27,269 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-08-30 22:36:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:27,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 22:36:27,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:27,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:36:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:27,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347546089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:36:27,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:36:27,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 22:36:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275322981] [2023-08-30 22:36:27,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:36:27,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 22:36:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 22:36:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 22:36:27,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 22:36:27,461 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-08-30 22:36:27,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:27,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 22:36:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:27,610 INFO L130 PetriNetUnfolder]: 246/536 cut-off events. [2023-08-30 22:36:27,610 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-08-30 22:36:27,611 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-08-30 22:36:27,612 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2023-08-30 22:36:27,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 372 flow [2023-08-30 22:36:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 22:36:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 22:36:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2023-08-30 22:36:27,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319237147595357 [2023-08-30 22:36:27,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1283 transitions. [2023-08-30 22:36:27,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1283 transitions. [2023-08-30 22:36:27,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:27,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1283 transitions. [2023-08-30 22:36:27,630 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-08-30 22:36:27,633 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-08-30 22:36:27,633 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-08-30 22:36:27,634 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 114 flow. Second operand 6 states and 1283 transitions. [2023-08-30 22:36:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 372 flow [2023-08-30 22:36:27,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 22:36:27,635 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 172 flow [2023-08-30 22:36:27,636 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-08-30 22:36:27,636 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-30 22:36:27,636 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 172 flow [2023-08-30 22:36:27,637 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-08-30 22:36:27,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:27,637 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-08-30 22:36:27,645 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-08-30 22:36:27,842 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-08-30 22:36:27,845 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-08-30 22:36:27,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-08-30 22:36:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890798647] [2023-08-30 22:36:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890798647] [2023-08-30 22:36:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890798647] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087963226] [2023-08-30 22:36:27,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 22:36:27,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:27,957 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-08-30 22:36:27,988 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-08-30 22:36:28,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 22:36:28,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 22:36:28,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 22:36:28,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:28,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:36:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087963226] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:36:28,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:36:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-30 22:36:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780548133] [2023-08-30 22:36:28,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:36:28,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 22:36:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:28,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 22:36:28,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 22:36:28,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 22:36:28,303 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-08-30 22:36:28,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:28,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 22:36:28,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:28,560 INFO L130 PetriNetUnfolder]: 423/937 cut-off events. [2023-08-30 22:36:28,560 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-08-30 22:36:28,561 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-08-30 22:36:28,564 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2023-08-30 22:36:28,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 838 flow [2023-08-30 22:36:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 22:36:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 22:36:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2564 transitions. [2023-08-30 22:36:28,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315091210613598 [2023-08-30 22:36:28,569 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2564 transitions. [2023-08-30 22:36:28,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2564 transitions. [2023-08-30 22:36:28,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:28,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2564 transitions. [2023-08-30 22:36:28,574 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-08-30 22:36:28,578 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-08-30 22:36:28,579 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-08-30 22:36:28,579 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 172 flow. Second operand 12 states and 2564 transitions. [2023-08-30 22:36:28,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 838 flow [2023-08-30 22:36:28,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 799 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-30 22:36:28,586 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 322 flow [2023-08-30 22:36:28,587 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-08-30 22:36:28,588 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-08-30 22:36:28,588 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 322 flow [2023-08-30 22:36:28,589 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-08-30 22:36:28,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:28,590 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-08-30 22:36:28,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 22:36:28,795 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-08-30 22:36:28,796 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-08-30 22:36:28,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-08-30 22:36:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995258696] [2023-08-30 22:36:28,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995258696] [2023-08-30 22:36:29,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995258696] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:29,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659290370] [2023-08-30 22:36:29,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 22:36:29,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:29,089 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-08-30 22:36:29,091 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-08-30 22:36:29,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 22:36:29,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 22:36:29,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-30 22:36:29,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:29,828 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-08-30 22:36:29,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:29,857 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-08-30 22:36:29,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:29,908 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-08-30 22:36:29,950 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-08-30 22:36:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-08-30 22:36:29,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 22:36:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659290370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:29,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 22:36:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-08-30 22:36:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666050857] [2023-08-30 22:36:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 22:36:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 22:36:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-08-30 22:36:30,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 402 [2023-08-30 22:36:30,102 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-08-30 22:36:30,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:30,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 402 [2023-08-30 22:36:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:30,289 INFO L130 PetriNetUnfolder]: 725/1591 cut-off events. [2023-08-30 22:36:30,289 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2023-08-30 22:36:30,291 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-08-30 22:36:30,295 INFO L137 encePairwiseOnDemand]: 394/402 looper letters, 89 selfloop transitions, 11 changer transitions 1/104 dead transitions. [2023-08-30 22:36:30,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 732 flow [2023-08-30 22:36:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 22:36:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 22:36:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2023-08-30 22:36:30,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995854063018242 [2023-08-30 22:36:30,298 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1205 transitions. [2023-08-30 22:36:30,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1205 transitions. [2023-08-30 22:36:30,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:30,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1205 transitions. [2023-08-30 22:36:30,300 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-08-30 22:36:30,302 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-08-30 22:36:30,303 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-08-30 22:36:30,303 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 322 flow. Second operand 6 states and 1205 transitions. [2023-08-30 22:36:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 732 flow [2023-08-30 22:36:30,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 716 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 22:36:30,307 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 400 flow [2023-08-30 22:36:30,307 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-08-30 22:36:30,307 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2023-08-30 22:36:30,307 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 400 flow [2023-08-30 22:36:30,308 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-08-30 22:36:30,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:30,308 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-08-30 22:36:30,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 22:36:30,514 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-08-30 22:36:30,514 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-08-30 22:36:30,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -345088948, now seen corresponding path program 1 times [2023-08-30 22:36:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262906423] [2023-08-30 22:36:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262906423] [2023-08-30 22:36:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262906423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011449397] [2023-08-30 22:36:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:30,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:30,747 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-08-30 22:36:30,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 22:36:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:30,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 22:36:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:31,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:36:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 22:36:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011449397] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:36:31,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:36:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-08-30 22:36:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592139823] [2023-08-30 22:36:31,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:36:31,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 22:36:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 22:36:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-08-30 22:36:31,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 22:36:31,239 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-08-30 22:36:31,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:31,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 22:36:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:31,769 INFO L130 PetriNetUnfolder]: 1178/2750 cut-off events. [2023-08-30 22:36:31,769 INFO L131 PetriNetUnfolder]: For 4953/4953 co-relation queries the response was YES. [2023-08-30 22:36:31,774 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-08-30 22:36:31,800 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 344 selfloop transitions, 43 changer transitions 0/391 dead transitions. [2023-08-30 22:36:31,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 391 transitions, 2837 flow [2023-08-30 22:36:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 22:36:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 22:36:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4698 transitions. [2023-08-30 22:36:31,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312075983717774 [2023-08-30 22:36:31,808 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4698 transitions. [2023-08-30 22:36:31,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4698 transitions. [2023-08-30 22:36:31,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:31,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4698 transitions. [2023-08-30 22:36:31,816 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-08-30 22:36:31,824 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-08-30 22:36:31,826 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-08-30 22:36:31,826 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 400 flow. Second operand 22 states and 4698 transitions. [2023-08-30 22:36:31,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 391 transitions, 2837 flow [2023-08-30 22:36:31,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 391 transitions, 2836 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 22:36:31,834 INFO L231 Difference]: Finished difference. Result has 106 places, 92 transitions, 782 flow [2023-08-30 22:36:31,835 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-08-30 22:36:31,835 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-08-30 22:36:31,835 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 782 flow [2023-08-30 22:36:31,837 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-08-30 22:36:31,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:31,837 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-08-30 22:36:31,844 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-08-30 22:36:32,049 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-08-30 22:36:32,049 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-08-30 22:36:32,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash -541637280, now seen corresponding path program 2 times [2023-08-30 22:36:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:32,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980301081] [2023-08-30 22:36:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2023-08-30 22:36:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980301081] [2023-08-30 22:36:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980301081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 22:36:33,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 22:36:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513341486] [2023-08-30 22:36:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:33,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 22:36:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 22:36:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 22:36:33,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 402 [2023-08-30 22:36:33,898 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-08-30 22:36:33,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:33,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 402 [2023-08-30 22:36:33,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:34,416 INFO L130 PetriNetUnfolder]: 1283/2843 cut-off events. [2023-08-30 22:36:34,417 INFO L131 PetriNetUnfolder]: For 4916/4916 co-relation queries the response was YES. [2023-08-30 22:36:34,423 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-08-30 22:36:34,431 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 93 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2023-08-30 22:36:34,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 1046 flow [2023-08-30 22:36:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 22:36:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 22:36:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2023-08-30 22:36:34,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494195688225539 [2023-08-30 22:36:34,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1192 transitions. [2023-08-30 22:36:34,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1192 transitions. [2023-08-30 22:36:34,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:34,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1192 transitions. [2023-08-30 22:36:34,437 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-08-30 22:36:34,439 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-08-30 22:36:34,439 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-08-30 22:36:34,439 INFO L175 Difference]: Start difference. First operand has 106 places, 92 transitions, 782 flow. Second operand 6 states and 1192 transitions. [2023-08-30 22:36:34,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 1046 flow [2023-08-30 22:36:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 1010 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-30 22:36:34,457 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 829 flow [2023-08-30 22:36:34,457 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-08-30 22:36:34,457 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-08-30 22:36:34,458 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 829 flow [2023-08-30 22:36:34,458 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-08-30 22:36:34,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:34,458 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-08-30 22:36:34,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 22:36:34,459 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-08-30 22:36:34,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash -49729782, now seen corresponding path program 3 times [2023-08-30 22:36:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284615067] [2023-08-30 22:36:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 613 proven. 53 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2023-08-30 22:36:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284615067] [2023-08-30 22:36:36,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284615067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:36,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516173649] [2023-08-30 22:36:36,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 22:36:36,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:36,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:36,573 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-08-30 22:36:36,575 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-08-30 22:36:38,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-30 22:36:38,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 22:36:38,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 135 conjunts are in the unsatisfiable core [2023-08-30 22:36:38,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:38,252 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-08-30 22:36:38,286 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-08-30 22:36:38,287 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-08-30 22:36:38,301 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-08-30 22:36:38,413 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-08-30 22:36:38,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:38,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:38,475 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-08-30 22:36:38,516 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-08-30 22:36:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2023-08-30 22:36:38,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 22:36:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516173649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 22:36:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 22:36:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2023-08-30 22:36:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201754988] [2023-08-30 22:36:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 22:36:38,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 22:36:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 22:36:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-08-30 22:36:38,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 402 [2023-08-30 22:36:38,783 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-08-30 22:36:38,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:38,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 402 [2023-08-30 22:36:38,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:39,211 INFO L130 PetriNetUnfolder]: 1289/2862 cut-off events. [2023-08-30 22:36:39,212 INFO L131 PetriNetUnfolder]: For 5300/5300 co-relation queries the response was YES. [2023-08-30 22:36:39,220 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-08-30 22:36:39,262 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 103 selfloop transitions, 9 changer transitions 1/116 dead transitions. [2023-08-30 22:36:39,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 1113 flow [2023-08-30 22:36:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 22:36:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 22:36:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2023-08-30 22:36:39,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49212271973466004 [2023-08-30 22:36:39,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1187 transitions. [2023-08-30 22:36:39,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1187 transitions. [2023-08-30 22:36:39,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:39,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1187 transitions. [2023-08-30 22:36:39,268 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-08-30 22:36:39,270 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-08-30 22:36:39,270 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-08-30 22:36:39,270 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 829 flow. Second operand 6 states and 1187 transitions. [2023-08-30 22:36:39,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 1113 flow [2023-08-30 22:36:39,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 1089 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-30 22:36:39,291 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 867 flow [2023-08-30 22:36:39,292 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-08-30 22:36:39,293 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2023-08-30 22:36:39,293 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 867 flow [2023-08-30 22:36:39,293 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-08-30 22:36:39,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:39,293 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-08-30 22:36:39,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 22:36:39,501 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-08-30 22:36:39,501 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-08-30 22:36:39,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1311907394, now seen corresponding path program 4 times [2023-08-30 22:36:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341560956] [2023-08-30 22:36:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2023-08-30 22:36:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341560956] [2023-08-30 22:36:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341560956] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358828924] [2023-08-30 22:36:41,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 22:36:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:41,091 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-08-30 22:36:41,093 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-08-30 22:36:41,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 22:36:41,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 22:36:41,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-30 22:36:41,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:41,812 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-08-30 22:36:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:41,832 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-08-30 22:36:41,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:41,875 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-08-30 22:36:41,915 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-08-30 22:36:41,965 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-08-30 22:36:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:41,987 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-08-30 22:36:42,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:42,032 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-08-30 22:36:42,062 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-08-30 22:36:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 665 proven. 35 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-08-30 22:36:42,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:36:42,151 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-08-30 22:36:42,162 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-08-30 22:36:42,182 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-08-30 22:36:42,206 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-08-30 22:36:42,225 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-08-30 22:36:42,285 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-08-30 22:36:42,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 22:36:42,297 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-08-30 22:36:42,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 22:36:42,305 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-08-30 22:36:42,318 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-08-30 22:36:42,324 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-08-30 22:36:42,340 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-08-30 22:36:42,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 22:36:42,429 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-08-30 22:36:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 630 proven. 31 refuted. 0 times theorem prover too weak. 495 trivial. 39 not checked. [2023-08-30 22:36:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358828924] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 22:36:42,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 22:36:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2023-08-30 22:36:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169443826] [2023-08-30 22:36:42,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 22:36:42,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 22:36:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 22:36:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 22:36:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=574, Unknown=6, NotChecked=342, Total=1122 [2023-08-30 22:36:42,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 402 [2023-08-30 22:36:42,546 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-08-30 22:36:42,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 22:36:42,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 402 [2023-08-30 22:36:42,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 22:36:44,065 INFO L130 PetriNetUnfolder]: 2349/5349 cut-off events. [2023-08-30 22:36:44,065 INFO L131 PetriNetUnfolder]: For 11791/11791 co-relation queries the response was YES. [2023-08-30 22:36:44,079 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-08-30 22:36:44,093 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 206 selfloop transitions, 52 changer transitions 1/262 dead transitions. [2023-08-30 22:36:44,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 262 transitions, 2608 flow [2023-08-30 22:36:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 22:36:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 22:36:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2943 transitions. [2023-08-30 22:36:44,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2023-08-30 22:36:44,099 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2943 transitions. [2023-08-30 22:36:44,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2943 transitions. [2023-08-30 22:36:44,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 22:36:44,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2943 transitions. [2023-08-30 22:36:44,105 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-08-30 22:36:44,111 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-08-30 22:36:44,111 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-08-30 22:36:44,112 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 867 flow. Second operand 18 states and 2943 transitions. [2023-08-30 22:36:44,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 262 transitions, 2608 flow [2023-08-30 22:36:44,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 262 transitions, 2590 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 22:36:44,141 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 1280 flow [2023-08-30 22:36:44,142 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-08-30 22:36:44,142 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 88 predicate places. [2023-08-30 22:36:44,142 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 135 transitions, 1280 flow [2023-08-30 22:36:44,143 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-08-30 22:36:44,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 22:36:44,144 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-08-30 22:36:44,151 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-08-30 22:36:44,352 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-08-30 22:36:44,352 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-08-30 22:36:44,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 22:36:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 259927122, now seen corresponding path program 5 times [2023-08-30 22:36:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 22:36:44,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390701960] [2023-08-30 22:36:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 22:36:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 22:36:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 22:36:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 678 proven. 60 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2023-08-30 22:36:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 22:36:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390701960] [2023-08-30 22:36:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390701960] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 22:36:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724154197] [2023-08-30 22:36:47,107 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 22:36:47,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 22:36:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 22:36:47,108 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-08-30 22:36:47,110 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-08-30 22:36:50,888 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-08-30 22:36:50,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 22:36:50,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 199 conjunts are in the unsatisfiable core [2023-08-30 22:36:50,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 22:36:50,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 0 case distinctions, treesize of input 23 treesize of output 13 [2023-08-30 22:36:50,981 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 22:36:50,981 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-08-30 22:36:51,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:51,100 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-08-30 22:36:51,100 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-08-30 22:36:51,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:51,167 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-08-30 22:36:51,271 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-08-30 22:36:51,317 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 22:36:51,318 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-08-30 22:36:51,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:51,440 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 22:36:51,441 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-08-30 22:36:51,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:51,539 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-08-30 22:36:51,645 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-08-30 22:36:51,697 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 22:36:51,698 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-08-30 22:36:51,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:51,831 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 22:36:51,832 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-08-30 22:36:51,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:51,897 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-08-30 22:36:52,011 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-08-30 22:36:52,067 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 22:36:52,067 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-08-30 22:36:52,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:52,212 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 22:36:52,212 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-08-30 22:36:52,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,290 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-08-30 22:36:52,349 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-08-30 22:36:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,376 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-08-30 22:36:52,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:52,464 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 22:36:52,464 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-08-30 22:36:52,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,521 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-08-30 22:36:52,597 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-08-30 22:36:52,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,632 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-08-30 22:36:52,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:52,726 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 22:36:52,726 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-08-30 22:36:52,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,787 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-08-30 22:36:52,864 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-08-30 22:36:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:52,898 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-08-30 22:36:52,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:52,996 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 22:36:52,996 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-08-30 22:36:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:53,054 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-08-30 22:36:53,134 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-08-30 22:36:53,179 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-08-30 22:36:53,180 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-08-30 22:36:53,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 22:36:53,235 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 22:36:53,235 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-08-30 22:36:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 22:36:53,272 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-08-30 22:36:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 905 proven. 112 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-08-30 22:36:53,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 22:49:27,912 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-08-30 22:49:33,543 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-08-30 22:49:38,925 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-08-30 22:49:44,504 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-08-30 22:49:59,418 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 Killed by 15