./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c --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/weaver/popl20-more-array-sum.wvr.c -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 c328ca6a6071aea6db12d1e311bd2e5e22fce6c700c884e61df52925e139f834 --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-31 02:54:08,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:54:08,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:54:08,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:54:08,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:54:08,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:54:08,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:54:08,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:54:08,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:54:08,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:54:08,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:54:08,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:54:08,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:54:08,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:54:08,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:54:08,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:54:08,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:54:08,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:54:08,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:54:08,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:54:08,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:54:08,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:54:08,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:54:08,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:54:08,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:54:08,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:54:08,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:54:08,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:54:08,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:54:08,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:54:08,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:54:08,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:54:08,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:54:08,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:54:08,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:54:08,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:54:08,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:54:08,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:54:08,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:54:08,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:54:08,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:54:08,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:54:08,742 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:54:08,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:54:08,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:54:08,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:54:08,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:54:08,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:54:08,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:54:08,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:54:08,744 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:54:08,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:54:08,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:54:08,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:54:08,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:54:08,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:54:08,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:54:08,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:54:08,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:54:08,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:54:08,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:54:08,748 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:54:08,748 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 -> c328ca6a6071aea6db12d1e311bd2e5e22fce6c700c884e61df52925e139f834 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-31 02:54:08,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:54:08,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:54:08,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:54:08,974 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:54:08,974 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:54:08,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-31 02:54:09,877 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:54:10,059 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:54:10,060 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-31 02:54:10,066 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8810e8d7d/85b211ae401149ba9b1401a99985406d/FLAGfa5c1eed8 [2023-08-31 02:54:10,082 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8810e8d7d/85b211ae401149ba9b1401a99985406d [2023-08-31 02:54:10,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:54:10,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:54:10,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:54:10,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:54:10,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:54:10,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473cfa5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10, skipping insertion in model container [2023-08-31 02:54:10,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:54:10,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:54:10,257 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-31 02:54:10,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:54:10,278 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:54:10,315 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-31 02:54:10,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:54:10,323 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:54:10,323 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:54:10,327 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:54:10,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10 WrapperNode [2023-08-31 02:54:10,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:54:10,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:54:10,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:54:10,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:54:10,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,370 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 284 [2023-08-31 02:54:10,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:54:10,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:54:10,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:54:10,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:54:10,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,393 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:54:10,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:54:10,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:54:10,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:54:10,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (1/1) ... [2023-08-31 02:54:10,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:54:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:54:10,432 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-31 02:54:10,455 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-31 02:54:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:54:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:54:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:54:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:54:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:54:10,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:54:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:54:10,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:54:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:54:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:54:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:54:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:54:10,493 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:54:10,583 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:54:10,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:54:11,017 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:54:11,205 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:54:11,206 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-31 02:54:11,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:54:11 BoogieIcfgContainer [2023-08-31 02:54:11,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:54:11,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:54:11,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:54:11,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:54:11,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:54:10" (1/3) ... [2023-08-31 02:54:11,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f0206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:54:11, skipping insertion in model container [2023-08-31 02:54:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:54:10" (2/3) ... [2023-08-31 02:54:11,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f0206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:54:11, skipping insertion in model container [2023-08-31 02:54:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:54:11" (3/3) ... [2023-08-31 02:54:11,214 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-08-31 02:54:11,219 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:54:11,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:54:11,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:54:11,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:54:11,279 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 02:54:11,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 183 transitions, 390 flow [2023-08-31 02:54:11,391 INFO L130 PetriNetUnfolder]: 16/180 cut-off events. [2023-08-31 02:54:11,391 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:54:11,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 16/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 112 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-31 02:54:11,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 183 transitions, 390 flow [2023-08-31 02:54:11,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 170 transitions, 358 flow [2023-08-31 02:54:11,404 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:54:11,413 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 170 transitions, 358 flow [2023-08-31 02:54:11,416 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 170 transitions, 358 flow [2023-08-31 02:54:11,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 358 flow [2023-08-31 02:54:11,445 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2023-08-31 02:54:11,446 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:54:11,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 170 events. 16/170 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2023-08-31 02:54:11,449 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-08-31 02:54:16,378 INFO L134 LiptonReduction]: Checked pairs total: 2268 [2023-08-31 02:54:16,378 INFO L136 LiptonReduction]: Total number of compositions: 170 [2023-08-31 02:54:16,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:54:16,391 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;@e4e32c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:54:16,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 02:54:16,396 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-08-31 02:54:16,396 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 02:54:16,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:54:16,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:54:16,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:54:16,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:54:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2134572771, now seen corresponding path program 1 times [2023-08-31 02:54:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:54:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182587191] [2023-08-31 02:54:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:54:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:16,825 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-31 02:54:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:54:16,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182587191] [2023-08-31 02:54:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182587191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:54:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:54:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:54:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138059170] [2023-08-31 02:54:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:54:16,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:54:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:54:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:54:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:54:16,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 353 [2023-08-31 02:54:16,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-31 02:54:16,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:54:16,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 353 [2023-08-31 02:54:16,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:54:17,065 INFO L130 PetriNetUnfolder]: 531/736 cut-off events. [2023-08-31 02:54:17,065 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-31 02:54:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 736 events. 531/736 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2525 event pairs, 185 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 1182. Up to 438 conditions per place. [2023-08-31 02:54:17,070 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-31 02:54:17,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 176 flow [2023-08-31 02:54:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:54:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:54:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-08-31 02:54:17,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660056657223796 [2023-08-31 02:54:17,082 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-08-31 02:54:17,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-08-31 02:54:17,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:54:17,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-08-31 02:54:17,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 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-31 02:54:17,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 0 states have call successors, (0), 0 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-31 02:54:17,092 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 0 states have call successors, (0), 0 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-31 02:54:17,093 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 4 states and 658 transitions. [2023-08-31 02:54:17,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 176 flow [2023-08-31 02:54:17,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 02:54:17,098 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 83 flow [2023-08-31 02:54:17,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-08-31 02:54:17,101 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-31 02:54:17,101 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 83 flow [2023-08-31 02:54:17,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-31 02:54:17,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:54:17,102 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] [2023-08-31 02:54:17,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:54:17,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:54:17,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:54:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1985121884, now seen corresponding path program 1 times [2023-08-31 02:54:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:54:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643513009] [2023-08-31 02:54:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:54:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:17,267 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-31 02:54:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:54:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643513009] [2023-08-31 02:54:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643513009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:54:17,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:54:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:54:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416679863] [2023-08-31 02:54:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:54:17,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:54:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:54:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:54:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:54:17,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 353 [2023-08-31 02:54:17,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-31 02:54:17,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:54:17,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 353 [2023-08-31 02:54:17,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:54:17,549 INFO L130 PetriNetUnfolder]: 532/741 cut-off events. [2023-08-31 02:54:17,550 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2023-08-31 02:54:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 741 events. 532/741 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2519 event pairs, 247 based on Foata normal form. 3/556 useless extension candidates. Maximal degree in co-relation 399. Up to 603 conditions per place. [2023-08-31 02:54:17,555 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 34 selfloop transitions, 5 changer transitions 3/44 dead transitions. [2023-08-31 02:54:17,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 199 flow [2023-08-31 02:54:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:54:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:54:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2023-08-31 02:54:17,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343720491029273 [2023-08-31 02:54:17,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 920 transitions. [2023-08-31 02:54:17,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 920 transitions. [2023-08-31 02:54:17,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:54:17,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 920 transitions. [2023-08-31 02:54:17,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 0 states have call successors, (0), 0 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-31 02:54:17,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 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-31 02:54:17,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 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-31 02:54:17,565 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 83 flow. Second operand 6 states and 920 transitions. [2023-08-31 02:54:17,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 199 flow [2023-08-31 02:54:17,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 02:54:17,567 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 109 flow [2023-08-31 02:54:17,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-31 02:54:17,568 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-08-31 02:54:17,568 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 109 flow [2023-08-31 02:54:17,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-31 02:54:17,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:54:17,569 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] [2023-08-31 02:54:17,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:54:17,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:54:17,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:54:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 963886311, now seen corresponding path program 1 times [2023-08-31 02:54:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:54:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806001072] [2023-08-31 02:54:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:54:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:54:17,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:54:17,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806001072] [2023-08-31 02:54:17,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806001072] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:54:17,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358335657] [2023-08-31 02:54:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:54:17,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:54:17,697 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-31 02:54:17,711 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-31 02:54:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:17,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 02:54:17,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:54:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:54:17,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:54:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:54:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358335657] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 02:54:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 02:54:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-31 02:54:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876998484] [2023-08-31 02:54:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:54:17,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:54:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:54:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:54:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 02:54:17,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-31 02:54:17,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-31 02:54:17,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:54:17,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-31 02:54:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:54:18,100 INFO L130 PetriNetUnfolder]: 508/732 cut-off events. [2023-08-31 02:54:18,100 INFO L131 PetriNetUnfolder]: For 179/215 co-relation queries the response was YES. [2023-08-31 02:54:18,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 732 events. 508/732 cut-off events. For 179/215 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2634 event pairs, 249 based on Foata normal form. 36/620 useless extension candidates. Maximal degree in co-relation 1721. Up to 571 conditions per place. [2023-08-31 02:54:18,104 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-31 02:54:18,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 233 flow [2023-08-31 02:54:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:54:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:54:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-08-31 02:54:18,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43059490084985835 [2023-08-31 02:54:18,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-08-31 02:54:18,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-08-31 02:54:18,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:54:18,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-08-31 02:54:18,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 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-31 02:54:18,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 0 states have call successors, (0), 0 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-31 02:54:18,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 0 states have call successors, (0), 0 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-31 02:54:18,112 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 109 flow. Second operand 5 states and 760 transitions. [2023-08-31 02:54:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 233 flow [2023-08-31 02:54:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 227 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 02:54:18,116 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 119 flow [2023-08-31 02:54:18,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-31 02:54:18,117 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-31 02:54:18,117 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 119 flow [2023-08-31 02:54:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-31 02:54:18,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:54:18,118 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-31 02:54:18,123 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-31 02:54:18,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:54:18,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:54:18,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:54:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1831077328, now seen corresponding path program 1 times [2023-08-31 02:54:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:54:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907605737] [2023-08-31 02:54:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:54:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:54:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:54:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907605737] [2023-08-31 02:54:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907605737] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:54:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229864828] [2023-08-31 02:54:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:54:19,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:54:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:54:19,831 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-31 02:54:19,834 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-31 02:54:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:54:19,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 81 conjunts are in the unsatisfiable core [2023-08-31 02:54:19,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:54:20,153 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-31 02:54:20,232 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 6 treesize of output 5 [2023-08-31 02:54:20,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:54:20,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:54:20,431 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 02:54:20,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-31 02:54:20,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:54:20,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:54:20,559 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 02:54:20,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-31 02:54:20,665 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:54:20,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:54:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:54:20,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:54:20,933 WARN L839 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_153 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) c_~res1~0) (<= c_~N~0 ~M~0))) is different from false [2023-08-31 02:54:20,993 WARN L839 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_152 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (<= c_~N~0 ~M~0) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_153)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) c_~res1~0))) is different from false [2023-08-31 02:54:21,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:54:21,254 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 105 treesize of output 70 [2023-08-31 02:54:21,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:54:21,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 614390 treesize of output 516154 [2023-08-31 02:54:21,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:54:21,775 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 2006 treesize of output 1822 [2023-08-31 02:54:21,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:54:21,817 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 1814 treesize of output 1438 [2023-08-31 02:54:21,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:54:21,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1430 treesize of output 1262 [2023-08-31 02:54:29,967 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:31,266 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:31,901 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:31,987 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:32,241 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:32,525 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:32,679 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:32,778 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:32,830 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:32,883 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:33,076 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:33,460 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:33,666 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:34,034 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:34,970 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:35,186 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:35,403 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:35,506 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:35,626 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:35,997 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:36,051 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:36,145 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:36,317 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:36,358 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:36,479 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:36,514 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:36,556 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:36,630 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:36,827 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:37,514 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:37,605 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:37,657 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:37,709 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:37,716 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:38,210 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:38,237 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:38,306 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:38,355 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:40,167 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:40,269 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:40,292 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:40,621 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:40,633 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:40,801 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:40,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:41,488 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:41,817 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:42,252 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:42,476 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:42,492 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:42,622 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:43,362 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:43,383 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:43,524 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:43,773 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:43,788 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:43,980 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:44,305 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:44,578 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:44,651 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:45,634 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:46,513 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:47,283 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:54:48,943 WARN L718 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-31 02:54:49,140 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:49,844 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:54:50,093 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:50,166 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:50,501 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:50,551 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:50,604 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:50,619 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:50,994 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:51,191 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:51,536 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:51,716 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:52,208 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:52,282 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:52,371 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:52,541 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:52,794 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:53,331 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:53,416 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:53,454 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:53,698 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:53,776 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:53,838 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:53,922 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:54,077 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:54,151 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:54,499 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:54,555 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:54,641 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:54,713 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:54:55,082 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:55,146 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:55,174 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:55,225 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:55,518 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:55,539 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:55,857 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:55,917 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:54:55,974 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:56,245 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:54:56,417 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:54:56,624 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:56,745 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:56,761 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:56,961 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:57,146 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:57,229 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:54:57,248 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:57,969 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:58,696 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:59,065 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:59,361 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:54:59,393 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:54:59,709 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:54:59,877 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:00,017 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:00,104 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:00,268 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:00,315 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:00,384 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:00,472 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:00,556 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:00,707 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:00,795 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:00,868 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:01,000 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:01,182 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:01,287 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:01,421 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:01,645 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:01,681 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:01,742 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:01,787 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:02,148 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:02,164 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:02,174 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:02,391 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:02,418 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:02,443 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:02,465 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:02,481 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:02,813 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:02,849 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:02,907 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:02,950 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:03,071 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:03,192 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:03,228 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:03,255 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:03,394 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:03,661 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:03,797 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:03,870 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,044 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:04,096 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,119 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:04,134 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,260 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,414 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:04,495 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,619 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:04,650 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,803 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:04,959 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:04,977 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:05,310 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,353 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:05,429 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,479 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:05,561 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:05,601 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,639 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:05,652 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,676 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,748 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:05,761 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:05,968 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:06,083 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:06,206 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:06,366 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:06,625 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:06,883 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:06,948 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:06,997 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:07,069 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:07,243 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:07,341 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:07,404 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:07,445 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:07,548 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:07,689 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:07,704 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:07,830 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:07,967 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,054 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,127 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,224 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,313 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:08,340 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,376 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,400 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,440 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,451 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:08,491 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:08,501 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:08,508 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:08,557 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,568 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:08,589 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:08,613 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:08,776 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,846 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,864 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:08,895 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:08,954 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:08,978 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:09,186 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:09,208 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:09,693 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:09,753 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:09,767 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:09,799 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:09,836 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:10,216 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,308 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,368 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:10,381 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,446 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:10,459 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,558 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,570 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:10,635 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:10,658 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,671 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:10,704 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:10,790 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:10,824 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:10,846 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:10,864 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:10,962 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:10,987 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:11,005 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:11,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:11,685 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:11,728 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:12,049 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:12,105 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:13,119 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:13,653 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:14,189 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:14,248 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:14,379 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:14,635 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:14,731 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:14,802 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:14,984 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:15,008 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:15,114 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:15,244 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:15,369 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:15,444 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:15,750 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:15,823 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:15,965 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:16,091 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:16,108 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:16,289 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:16,353 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:16,478 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:16,530 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:16,580 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:16,643 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:16,718 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:16,729 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:16,749 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:16,769 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:17,009 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:17,198 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:17,303 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:17,815 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:18,156 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:18,173 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:18,548 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:18,650 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:19,348 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:55:19,467 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:19,730 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:20,031 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:20,366 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:20,415 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:20,543 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:20,687 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:20,702 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:20,830 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:20,994 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:21,163 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:21,352 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:21,495 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:21,509 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:21,869 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:21,906 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:21,919 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:22,054 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:22,106 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:22,410 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:22,572 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:22,684 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:22,750 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:22,928 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:23,383 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:23,842 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:23,872 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:23,942 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:23,992 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:25,776 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:27,926 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:28,784 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:29,173 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:29,213 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:29,440 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:29,556 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:29,573 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:29,595 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:29,699 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:29,750 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:29,777 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:30,761 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:31,068 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:31,082 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:31,129 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:31,147 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:31,344 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:31,396 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:31,427 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:31,434 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:39,538 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:40,453 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:40,593 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:41,122 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:41,176 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:41,439 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:41,517 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:42,264 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:43,112 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:43,831 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:55:45,834 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:46,421 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:46,893 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:47,021 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:47,043 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:47,197 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:47,653 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:47,840 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:47,873 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:48,331 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:48,365 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:48,390 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:48,494 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:48,542 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:48,881 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:48,955 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:49,276 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:49,597 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:49,939 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:50,155 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:50,632 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:50,650 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:51,232 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:51,341 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:51,624 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:51,640 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:52,121 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:52,139 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:52,287 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:53,041 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:53,176 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:53,245 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:54,083 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:54,558 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:55,754 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:55,786 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:55,960 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:56,269 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:55:56,371 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:56,736 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:57,426 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:55:58,461 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:58,479 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:58,503 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:58,562 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:58,592 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:58,614 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:58,967 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:58,980 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:58,995 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:55:59,002 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:55:59,119 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:59,137 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:55:59,156 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:59,286 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:59,393 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:55:59,528 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:55:59,596 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:55:59,627 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:00,728 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:00,948 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:01,104 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:01,818 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:02,317 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:02,411 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:02,752 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:02,789 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:02,933 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:03,629 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:04,081 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:56:07,110 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:07,271 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:07,612 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:07,700 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:07,858 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:07,963 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:08,802 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:08,974 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:10,659 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:10,909 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:15,309 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:18,193 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:18,354 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:22,275 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:22,792 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:22,844 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:23,158 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:23,292 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:23,310 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:23,338 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:23,472 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:23,524 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:23,556 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:24,411 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:24,904 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:24,971 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:25,004 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:25,014 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:26,473 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:26,521 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:26,812 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:26,942 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:26,961 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:26,989 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:27,110 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:27,168 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:27,201 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:28,023 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:28,064 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:28,385 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:28,752 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:28,768 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:28,818 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:28,843 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:29,071 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:29,129 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:29,162 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:29,170 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:32,575 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:33,089 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:33,117 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:34,286 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:34,310 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:34,333 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:34,376 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:34,406 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:34,421 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:34,439 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:34,786 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:34,804 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:34,912 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:34,987 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:35,055 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:35,232 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:35,948 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:35,973 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:36,778 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:36,839 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:37,120 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:37,135 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:37,152 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:37,181 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:37,293 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:37,419 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:37,867 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:43,831 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:45,090 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:45,602 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:45,825 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:45,964 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:46,263 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:46,725 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:47,238 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:47,871 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:47,925 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:47,983 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:48,160 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:48,269 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:48,282 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:48,301 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:48,344 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:48,462 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:48,477 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:48,507 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:48,539 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:48,559 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:48,601 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:48,627 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:48,768 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:49,968 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:52,205 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:56:53,349 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:56:53,368 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:53,678 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:54,156 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-31 02:56:54,184 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:54,864 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:55,849 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:55,966 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:56,110 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:56,184 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:56,217 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:56:56,244 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:56,618 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:56,655 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:56:56,806 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:56:56,847 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:56:58,169 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:56:59,015 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:56:59,642 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:57:00,032 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:00,068 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:00,217 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:00,251 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:00,794 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:00,821 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:00,892 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:57:00,952 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:57:00,976 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:01,075 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:57:01,281 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:01,636 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:57:02,162 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:57:02,608 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-31 02:57:03,138 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-31 02:57:04,226 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:05,147 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:05,298 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:05,473 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:06,299 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:06,364 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:06,394 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-31 02:57:06,419 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-31 02:57:06,914 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:07,511 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:07,619 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:07,654 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:07,753 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:07,767 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:07,975 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:08,017 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-31 02:57:08,145 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:08,182 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:08,264 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-31 02:57:10,167 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:18,333 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:18,791 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-31 02:57:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 02:57:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229864828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:57:45,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:57:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2023-08-31 02:57:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249971066] [2023-08-31 02:57:45,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:57:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 02:57:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 02:57:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1035, Unknown=27, NotChecked=134, Total=1332 [2023-08-31 02:57:45,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 353 [2023-08-31 02:57:45,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 119 flow. Second operand has 37 states, 37 states have (on average 83.70270270270271) internal successors, (3097), 37 states have internal predecessors, (3097), 0 states have call successors, (0), 0 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-31 02:57:45,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:45,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 353 [2023-08-31 02:57:45,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:49,291 INFO L130 PetriNetUnfolder]: 2209/3256 cut-off events. [2023-08-31 02:57:49,291 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2023-08-31 02:57:49,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8767 conditions, 3256 events. 2209/3256 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15116 event pairs, 48 based on Foata normal form. 2/2758 useless extension candidates. Maximal degree in co-relation 6027. Up to 1223 conditions per place. [2023-08-31 02:57:49,307 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 238 selfloop transitions, 101 changer transitions 9/348 dead transitions. [2023-08-31 02:57:49,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 348 transitions, 1765 flow [2023-08-31 02:57:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-31 02:57:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-31 02:57:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3296 transitions. [2023-08-31 02:57:49,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25936418004406675 [2023-08-31 02:57:49,316 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3296 transitions. [2023-08-31 02:57:49,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3296 transitions. [2023-08-31 02:57:49,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:49,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3296 transitions. [2023-08-31 02:57:49,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 91.55555555555556) internal successors, (3296), 36 states have internal predecessors, (3296), 0 states have call successors, (0), 0 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-31 02:57:49,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 353.0) internal successors, (13061), 37 states have internal predecessors, (13061), 0 states have call successors, (0), 0 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-31 02:57:49,333 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 353.0) internal successors, (13061), 37 states have internal predecessors, (13061), 0 states have call successors, (0), 0 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-31 02:57:49,334 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 119 flow. Second operand 36 states and 3296 transitions. [2023-08-31 02:57:49,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 348 transitions, 1765 flow [2023-08-31 02:57:49,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 348 transitions, 1737 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-31 02:57:49,343 INFO L231 Difference]: Finished difference. Result has 89 places, 131 transitions, 856 flow [2023-08-31 02:57:49,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=856, PETRI_PLACES=89, PETRI_TRANSITIONS=131} [2023-08-31 02:57:49,344 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2023-08-31 02:57:49,344 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 131 transitions, 856 flow [2023-08-31 02:57:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 83.70270270270271) internal successors, (3097), 37 states have internal predecessors, (3097), 0 states have call successors, (0), 0 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-31 02:57:49,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:49,346 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-31 02:57:49,355 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-31 02:57:49,551 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,SelfDestructingSolverStorable3 [2023-08-31 02:57:49,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:57:49,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash 550186672, now seen corresponding path program 2 times [2023-08-31 02:57:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248365118] [2023-08-31 02:57:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:57:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248365118] [2023-08-31 02:57:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248365118] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645928037] [2023-08-31 02:57:50,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:57:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:50,794 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-31 02:57:50,797 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-31 02:57:50,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:57:50,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:57:50,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-31 02:57:50,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:51,221 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:57:51,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:57:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:51,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:57:51,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:51,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-31 02:57:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645928037] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:57:51,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:57:51,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-08-31 02:57:51,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864996785] [2023-08-31 02:57:51,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:57:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 02:57:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 02:57:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2023-08-31 02:57:53,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-08-31 02:57:53,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 131 transitions, 856 flow. Second operand has 32 states, 32 states have (on average 117.09375) internal successors, (3747), 32 states have internal predecessors, (3747), 0 states have call successors, (0), 0 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-31 02:57:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:53,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-08-31 02:57:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:55,112 INFO L130 PetriNetUnfolder]: 2579/3907 cut-off events. [2023-08-31 02:57:55,112 INFO L131 PetriNetUnfolder]: For 9109/9109 co-relation queries the response was YES. [2023-08-31 02:57:55,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15132 conditions, 3907 events. 2579/3907 cut-off events. For 9109/9109 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19507 event pairs, 244 based on Foata normal form. 3/3910 useless extension candidates. Maximal degree in co-relation 15030. Up to 2645 conditions per place. [2023-08-31 02:57:55,136 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 172 selfloop transitions, 142 changer transitions 19/333 dead transitions. [2023-08-31 02:57:55,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 333 transitions, 2624 flow [2023-08-31 02:57:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 02:57:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 02:57:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2817 transitions. [2023-08-31 02:57:55,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469639118117995 [2023-08-31 02:57:55,142 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2817 transitions. [2023-08-31 02:57:55,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2817 transitions. [2023-08-31 02:57:55,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:55,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2817 transitions. [2023-08-31 02:57:55,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 122.47826086956522) internal successors, (2817), 23 states have internal predecessors, (2817), 0 states have call successors, (0), 0 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-31 02:57:55,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 353.0) internal successors, (8472), 24 states have internal predecessors, (8472), 0 states have call successors, (0), 0 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-31 02:57:55,155 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 353.0) internal successors, (8472), 24 states have internal predecessors, (8472), 0 states have call successors, (0), 0 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-31 02:57:55,155 INFO L175 Difference]: Start difference. First operand has 89 places, 131 transitions, 856 flow. Second operand 23 states and 2817 transitions. [2023-08-31 02:57:55,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 333 transitions, 2624 flow [2023-08-31 02:57:55,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 333 transitions, 2592 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 02:57:55,204 INFO L231 Difference]: Finished difference. Result has 120 places, 223 transitions, 2088 flow [2023-08-31 02:57:55,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2088, PETRI_PLACES=120, PETRI_TRANSITIONS=223} [2023-08-31 02:57:55,205 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 87 predicate places. [2023-08-31 02:57:55,205 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 223 transitions, 2088 flow [2023-08-31 02:57:55,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 117.09375) internal successors, (3747), 32 states have internal predecessors, (3747), 0 states have call successors, (0), 0 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-31 02:57:55,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:55,206 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-31 02:57:55,211 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-31 02:57:55,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:55,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:57:55,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1216314062, now seen corresponding path program 3 times [2023-08-31 02:57:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223003073] [2023-08-31 02:57:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223003073] [2023-08-31 02:57:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223003073] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662682122] [2023-08-31 02:57:56,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:57:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:56,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:56,036 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-31 02:57:56,040 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-31 02:57:56,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 02:57:56,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:57:56,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 02:57:56,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:56,503 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:57:56,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:57:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:56,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:57:56,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:56,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-31 02:57:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662682122] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:57:56,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:57:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-08-31 02:57:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858959793] [2023-08-31 02:57:56,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:57:56,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 02:57:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:56,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 02:57:56,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-08-31 02:57:57,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 353 [2023-08-31 02:57:58,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 223 transitions, 2088 flow. Second operand has 23 states, 23 states have (on average 127.21739130434783) internal successors, (2926), 23 states have internal predecessors, (2926), 0 states have call successors, (0), 0 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-31 02:57:58,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:58,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 353 [2023-08-31 02:57:58,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:59,808 INFO L130 PetriNetUnfolder]: 3615/5472 cut-off events. [2023-08-31 02:57:59,808 INFO L131 PetriNetUnfolder]: For 22945/23105 co-relation queries the response was YES. [2023-08-31 02:57:59,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25460 conditions, 5472 events. 3615/5472 cut-off events. For 22945/23105 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30143 event pairs, 284 based on Foata normal form. 76/5496 useless extension candidates. Maximal degree in co-relation 25397. Up to 3022 conditions per place. [2023-08-31 02:57:59,855 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 226 selfloop transitions, 290 changer transitions 6/528 dead transitions. [2023-08-31 02:57:59,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 528 transitions, 5269 flow [2023-08-31 02:57:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-31 02:57:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-31 02:57:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4520 transitions. [2023-08-31 02:57:59,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3766038993501083 [2023-08-31 02:57:59,864 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4520 transitions. [2023-08-31 02:57:59,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4520 transitions. [2023-08-31 02:57:59,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:59,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4520 transitions. [2023-08-31 02:57:59,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 132.94117647058823) internal successors, (4520), 34 states have internal predecessors, (4520), 0 states have call successors, (0), 0 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-31 02:57:59,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 353.0) internal successors, (12355), 35 states have internal predecessors, (12355), 0 states have call successors, (0), 0 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-31 02:57:59,883 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 353.0) internal successors, (12355), 35 states have internal predecessors, (12355), 0 states have call successors, (0), 0 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-31 02:57:59,883 INFO L175 Difference]: Start difference. First operand has 120 places, 223 transitions, 2088 flow. Second operand 34 states and 4520 transitions. [2023-08-31 02:57:59,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 528 transitions, 5269 flow [2023-08-31 02:58:00,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 528 transitions, 5077 flow, removed 89 selfloop flow, removed 5 redundant places. [2023-08-31 02:58:00,026 INFO L231 Difference]: Finished difference. Result has 153 places, 371 transitions, 4141 flow [2023-08-31 02:58:00,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4141, PETRI_PLACES=153, PETRI_TRANSITIONS=371} [2023-08-31 02:58:00,026 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2023-08-31 02:58:00,027 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 371 transitions, 4141 flow [2023-08-31 02:58:00,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 127.21739130434783) internal successors, (2926), 23 states have internal predecessors, (2926), 0 states have call successors, (0), 0 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-31 02:58:00,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:58:00,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:58:00,035 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-31 02:58:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:00,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:58:00,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:58:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1145552732, now seen corresponding path program 4 times [2023-08-31 02:58:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:58:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294120621] [2023-08-31 02:58:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:58:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:58:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:58:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:58:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294120621] [2023-08-31 02:58:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294120621] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:58:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936798584] [2023-08-31 02:58:01,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 02:58:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:01,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:58:01,160 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-31 02:58:01,162 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-31 02:58:01,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 02:58:01,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:58:01,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-31 02:58:01,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:58:01,559 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:58:01,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:58:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:58:01,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:58:01,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:58:01,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-31 02:58:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:58:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936798584] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:58:01,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:58:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 29 [2023-08-31 02:58:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913216956] [2023-08-31 02:58:01,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:58:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-31 02:58:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:58:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-31 02:58:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2023-08-31 02:58:04,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-31 02:58:04,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 371 transitions, 4141 flow. Second operand has 31 states, 31 states have (on average 115.16129032258064) internal successors, (3570), 31 states have internal predecessors, (3570), 0 states have call successors, (0), 0 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-31 02:58:04,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:58:04,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-31 02:58:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:58:11,021 INFO L130 PetriNetUnfolder]: 6340/9484 cut-off events. [2023-08-31 02:58:11,021 INFO L131 PetriNetUnfolder]: For 51057/51057 co-relation queries the response was YES. [2023-08-31 02:58:11,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49984 conditions, 9484 events. 6340/9484 cut-off events. For 51057/51057 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 54449 event pairs, 501 based on Foata normal form. 3/9487 useless extension candidates. Maximal degree in co-relation 49823. Up to 5166 conditions per place. [2023-08-31 02:58:11,076 INFO L137 encePairwiseOnDemand]: 335/353 looper letters, 465 selfloop transitions, 718 changer transitions 10/1193 dead transitions. [2023-08-31 02:58:11,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1193 transitions, 13522 flow [2023-08-31 02:58:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-31 02:58:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-31 02:58:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 9023 transitions. [2023-08-31 02:58:11,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34081208687440984 [2023-08-31 02:58:11,084 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 9023 transitions. [2023-08-31 02:58:11,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 9023 transitions. [2023-08-31 02:58:11,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:58:11,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 9023 transitions. [2023-08-31 02:58:11,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 120.30666666666667) internal successors, (9023), 75 states have internal predecessors, (9023), 0 states have call successors, (0), 0 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-31 02:58:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 353.0) internal successors, (26828), 76 states have internal predecessors, (26828), 0 states have call successors, (0), 0 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-31 02:58:11,115 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 353.0) internal successors, (26828), 76 states have internal predecessors, (26828), 0 states have call successors, (0), 0 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-31 02:58:11,115 INFO L175 Difference]: Start difference. First operand has 153 places, 371 transitions, 4141 flow. Second operand 75 states and 9023 transitions. [2023-08-31 02:58:11,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1193 transitions, 13522 flow [2023-08-31 02:58:11,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1193 transitions, 13069 flow, removed 105 selfloop flow, removed 11 redundant places. [2023-08-31 02:58:11,564 INFO L231 Difference]: Finished difference. Result has 236 places, 906 transitions, 11904 flow [2023-08-31 02:58:11,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=3972, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=11904, PETRI_PLACES=236, PETRI_TRANSITIONS=906} [2023-08-31 02:58:11,565 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 203 predicate places. [2023-08-31 02:58:11,565 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 906 transitions, 11904 flow [2023-08-31 02:58:11,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 115.16129032258064) internal successors, (3570), 31 states have internal predecessors, (3570), 0 states have call successors, (0), 0 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-31 02:58:11,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:58:11,566 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-31 02:58:11,571 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-31 02:58:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:11,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:58:11,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:58:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1850509082, now seen corresponding path program 5 times [2023-08-31 02:58:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:58:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973350603] [2023-08-31 02:58:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:58:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:58:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:58:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:58:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973350603] [2023-08-31 02:58:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973350603] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:58:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340855471] [2023-08-31 02:58:13,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 02:58:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:58:13,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-31 02:58:13,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-31 02:58:13,183 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 02:58:13,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:58:13,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-31 02:58:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:58:13,383 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:58:13,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:58:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:58:13,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:58:13,620 INFO L321 Elim1Store]: treesize reduction 57, result has 26.0 percent of original size [2023-08-31 02:58:13,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2023-08-31 02:58:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:58:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340855471] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:58:13,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:58:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 6] total 27 [2023-08-31 02:58:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491602370] [2023-08-31 02:58:13,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:58:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-31 02:58:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:58:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-31 02:58:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-08-31 02:58:15,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-08-31 02:58:15,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 906 transitions, 11904 flow. Second operand has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 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-31 02:58:15,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:58:15,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-08-31 02:58:15,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:58:20,869 INFO L130 PetriNetUnfolder]: 8536/13011 cut-off events. [2023-08-31 02:58:20,869 INFO L131 PetriNetUnfolder]: For 129116/129116 co-relation queries the response was YES. [2023-08-31 02:58:20,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82969 conditions, 13011 events. 8536/13011 cut-off events. For 129116/129116 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 81709 event pairs, 306 based on Foata normal form. 4/13015 useless extension candidates. Maximal degree in co-relation 82689. Up to 4915 conditions per place. [2023-08-31 02:58:20,977 INFO L137 encePairwiseOnDemand]: 334/353 looper letters, 575 selfloop transitions, 1056 changer transitions 28/1659 dead transitions. [2023-08-31 02:58:20,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1659 transitions, 23226 flow [2023-08-31 02:58:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-31 02:58:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-31 02:58:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5808 transitions. [2023-08-31 02:58:20,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35006931468868663 [2023-08-31 02:58:20,982 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 5808 transitions. [2023-08-31 02:58:20,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 5808 transitions. [2023-08-31 02:58:20,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:58:20,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 5808 transitions. [2023-08-31 02:58:20,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 123.57446808510639) internal successors, (5808), 47 states have internal predecessors, (5808), 0 states have call successors, (0), 0 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-31 02:58:20,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 353.0) internal successors, (16944), 48 states have internal predecessors, (16944), 0 states have call successors, (0), 0 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-31 02:58:20,998 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 353.0) internal successors, (16944), 48 states have internal predecessors, (16944), 0 states have call successors, (0), 0 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-31 02:58:20,998 INFO L175 Difference]: Start difference. First operand has 236 places, 906 transitions, 11904 flow. Second operand 47 states and 5808 transitions. [2023-08-31 02:58:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1659 transitions, 23226 flow [2023-08-31 02:58:22,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1659 transitions, 22531 flow, removed 333 selfloop flow, removed 5 redundant places. [2023-08-31 02:58:22,121 INFO L231 Difference]: Finished difference. Result has 291 places, 1369 transitions, 20857 flow [2023-08-31 02:58:22,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=11492, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=662, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=20857, PETRI_PLACES=291, PETRI_TRANSITIONS=1369} [2023-08-31 02:58:22,122 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 258 predicate places. [2023-08-31 02:58:22,122 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1369 transitions, 20857 flow [2023-08-31 02:58:22,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 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-31 02:58:22,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:58:22,123 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-31 02:58:22,128 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-31 02:58:22,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:22,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:58:22,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:58:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1223354686, now seen corresponding path program 6 times [2023-08-31 02:58:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:58:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345208836] [2023-08-31 02:58:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:58:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:58:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:58:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:58:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345208836] [2023-08-31 02:58:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345208836] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:58:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475297799] [2023-08-31 02:58:23,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 02:58:23,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:23,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:58:23,248 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-31 02:58:23,250 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-31 02:58:23,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 02:58:23,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:58:23,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 02:58:23,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:58:23,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:58:23,702 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 27 treesize of output 19 [2023-08-31 02:58:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:23,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:58:23,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:58:23,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-31 02:58:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:24,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475297799] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:58:24,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:58:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-08-31 02:58:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496558607] [2023-08-31 02:58:24,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:58:24,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 02:58:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:58:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 02:58:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2023-08-31 02:58:26,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-08-31 02:58:26,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1369 transitions, 20857 flow. Second operand has 32 states, 32 states have (on average 113.90625) internal successors, (3645), 32 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-31 02:58:26,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:58:26,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-08-31 02:58:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:58:31,711 INFO L130 PetriNetUnfolder]: 9040/13746 cut-off events. [2023-08-31 02:58:31,711 INFO L131 PetriNetUnfolder]: For 172332/172332 co-relation queries the response was YES. [2023-08-31 02:58:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97151 conditions, 13746 events. 9040/13746 cut-off events. For 172332/172332 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 85972 event pairs, 930 based on Foata normal form. 3/13749 useless extension candidates. Maximal degree in co-relation 96976. Up to 8548 conditions per place. [2023-08-31 02:58:31,866 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 721 selfloop transitions, 1039 changer transitions 9/1769 dead transitions. [2023-08-31 02:58:31,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1769 transitions, 28978 flow [2023-08-31 02:58:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-31 02:58:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-31 02:58:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 4639 transitions. [2023-08-31 02:58:31,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3369652066535919 [2023-08-31 02:58:31,880 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 4639 transitions. [2023-08-31 02:58:31,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 4639 transitions. [2023-08-31 02:58:31,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:58:31,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 4639 transitions. [2023-08-31 02:58:31,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 118.94871794871794) internal successors, (4639), 39 states have internal predecessors, (4639), 0 states have call successors, (0), 0 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-31 02:58:31,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 353.0) internal successors, (14120), 40 states have internal predecessors, (14120), 0 states have call successors, (0), 0 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-31 02:58:31,901 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 353.0) internal successors, (14120), 40 states have internal predecessors, (14120), 0 states have call successors, (0), 0 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-31 02:58:31,901 INFO L175 Difference]: Start difference. First operand has 291 places, 1369 transitions, 20857 flow. Second operand 39 states and 4639 transitions. [2023-08-31 02:58:31,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1769 transitions, 28978 flow [2023-08-31 02:58:34,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1769 transitions, 27729 flow, removed 453 selfloop flow, removed 9 redundant places. [2023-08-31 02:58:34,724 INFO L231 Difference]: Finished difference. Result has 327 places, 1565 transitions, 26198 flow [2023-08-31 02:58:34,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=19863, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=841, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=26198, PETRI_PLACES=327, PETRI_TRANSITIONS=1565} [2023-08-31 02:58:34,725 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 294 predicate places. [2023-08-31 02:58:34,725 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 1565 transitions, 26198 flow [2023-08-31 02:58:34,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 113.90625) internal successors, (3645), 32 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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-31 02:58:34,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:58:34,726 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-31 02:58:34,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 02:58:34,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:34,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:58:34,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:58:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1789474852, now seen corresponding path program 7 times [2023-08-31 02:58:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:58:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252332971] [2023-08-31 02:58:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:58:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:58:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:58:35,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252332971] [2023-08-31 02:58:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252332971] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:58:35,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918836265] [2023-08-31 02:58:35,502 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 02:58:35,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:58:35,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:58:35,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-31 02:58:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:35,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-31 02:58:35,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:58:35,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:58:35,880 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-31 02:58:35,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2023-08-31 02:58:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:35,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:58:35,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:58:35,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-08-31 02:58:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918836265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:58:36,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:58:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2023-08-31 02:58:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696356034] [2023-08-31 02:58:36,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:58:36,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-31 02:58:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:58:36,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-31 02:58:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-08-31 02:58:37,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 353 [2023-08-31 02:58:37,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 1565 transitions, 26198 flow. Second operand has 27 states, 27 states have (on average 125.11111111111111) internal successors, (3378), 27 states have internal predecessors, (3378), 0 states have call successors, (0), 0 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-31 02:58:37,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:58:37,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 353 [2023-08-31 02:58:37,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:58:43,107 INFO L130 PetriNetUnfolder]: 10804/16522 cut-off events. [2023-08-31 02:58:43,107 INFO L131 PetriNetUnfolder]: For 213024/213143 co-relation queries the response was YES. [2023-08-31 02:58:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120814 conditions, 16522 events. 10804/16522 cut-off events. For 213024/213143 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 108505 event pairs, 1396 based on Foata normal form. 78/16565 useless extension candidates. Maximal degree in co-relation 120417. Up to 9462 conditions per place. [2023-08-31 02:58:43,254 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 993 selfloop transitions, 1210 changer transitions 5/2235 dead transitions. [2023-08-31 02:58:43,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 2235 transitions, 39982 flow [2023-08-31 02:58:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-31 02:58:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-31 02:58:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4460 transitions. [2023-08-31 02:58:43,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3716047325445759 [2023-08-31 02:58:43,261 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4460 transitions. [2023-08-31 02:58:43,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4460 transitions. [2023-08-31 02:58:43,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:58:43,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4460 transitions. [2023-08-31 02:58:43,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 131.1764705882353) internal successors, (4460), 34 states have internal predecessors, (4460), 0 states have call successors, (0), 0 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-31 02:58:43,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 353.0) internal successors, (12355), 35 states have internal predecessors, (12355), 0 states have call successors, (0), 0 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-31 02:58:43,277 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 353.0) internal successors, (12355), 35 states have internal predecessors, (12355), 0 states have call successors, (0), 0 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-31 02:58:43,277 INFO L175 Difference]: Start difference. First operand has 327 places, 1565 transitions, 26198 flow. Second operand 34 states and 4460 transitions. [2023-08-31 02:58:43,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 2235 transitions, 39982 flow [2023-08-31 02:58:47,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 2235 transitions, 39299 flow, removed 89 selfloop flow, removed 15 redundant places. [2023-08-31 02:58:47,298 INFO L231 Difference]: Finished difference. Result has 358 places, 1960 transitions, 37270 flow [2023-08-31 02:58:47,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=25668, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=819, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=37270, PETRI_PLACES=358, PETRI_TRANSITIONS=1960} [2023-08-31 02:58:47,300 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 325 predicate places. [2023-08-31 02:58:47,300 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1960 transitions, 37270 flow [2023-08-31 02:58:47,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 125.11111111111111) internal successors, (3378), 27 states have internal predecessors, (3378), 0 states have call successors, (0), 0 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-31 02:58:47,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:58:47,301 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-31 02:58:47,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-31 02:58:47,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-31 02:58:47,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:58:47,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:58:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1064531612, now seen corresponding path program 8 times [2023-08-31 02:58:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:58:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022488043] [2023-08-31 02:58:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:58:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:58:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:58:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:58:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:58:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022488043] [2023-08-31 02:58:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022488043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:58:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837035599] [2023-08-31 02:58:48,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:58:48,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:58:48,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:58:48,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:58:48,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 02:58:48,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:58:48,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:58:48,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-31 02:58:48,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:58:49,015 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:58:49,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:58:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:49,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:58:49,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:58:49,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 02:58:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:58:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837035599] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:58:49,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:58:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 33 [2023-08-31 02:58:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922599443] [2023-08-31 02:58:49,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:58:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-31 02:58:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:58:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-31 02:58:49,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2023-08-31 02:58:51,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-08-31 02:58:51,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1960 transitions, 37270 flow. Second operand has 35 states, 35 states have (on average 113.8) internal successors, (3983), 35 states have internal predecessors, (3983), 0 states have call successors, (0), 0 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-31 02:58:51,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:58:51,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-08-31 02:58:51,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:59:04,953 INFO L130 PetriNetUnfolder]: 14020/21192 cut-off events. [2023-08-31 02:59:04,953 INFO L131 PetriNetUnfolder]: For 329859/329859 co-relation queries the response was YES. [2023-08-31 02:59:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165740 conditions, 21192 events. 14020/21192 cut-off events. For 329859/329859 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 140821 event pairs, 1043 based on Foata normal form. 2/21194 useless extension candidates. Maximal degree in co-relation 165290. Up to 11281 conditions per place. [2023-08-31 02:59:05,187 INFO L137 encePairwiseOnDemand]: 336/353 looper letters, 720 selfloop transitions, 2274 changer transitions 6/3000 dead transitions. [2023-08-31 02:59:05,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 3000 transitions, 58069 flow [2023-08-31 02:59:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-08-31 02:59:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-08-31 02:59:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 11031 transitions. [2023-08-31 02:59:05,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3360138901580919 [2023-08-31 02:59:05,195 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 11031 transitions. [2023-08-31 02:59:05,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 11031 transitions. [2023-08-31 02:59:05,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:59:05,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 11031 transitions. [2023-08-31 02:59:05,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 118.61290322580645) internal successors, (11031), 93 states have internal predecessors, (11031), 0 states have call successors, (0), 0 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-31 02:59:05,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 353.0) internal successors, (33182), 94 states have internal predecessors, (33182), 0 states have call successors, (0), 0 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-31 02:59:05,224 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 353.0) internal successors, (33182), 94 states have internal predecessors, (33182), 0 states have call successors, (0), 0 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-31 02:59:05,224 INFO L175 Difference]: Start difference. First operand has 358 places, 1960 transitions, 37270 flow. Second operand 93 states and 11031 transitions. [2023-08-31 02:59:05,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 3000 transitions, 58069 flow [2023-08-31 02:59:13,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 3000 transitions, 57792 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-31 02:59:13,476 INFO L231 Difference]: Finished difference. Result has 460 places, 2713 transitions, 57124 flow [2023-08-31 02:59:13,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=37045, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1578, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=57124, PETRI_PLACES=460, PETRI_TRANSITIONS=2713} [2023-08-31 02:59:13,478 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 427 predicate places. [2023-08-31 02:59:13,478 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 2713 transitions, 57124 flow [2023-08-31 02:59:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 113.8) internal successors, (3983), 35 states have internal predecessors, (3983), 0 states have call successors, (0), 0 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-31 02:59:13,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:59:13,479 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-31 02:59:13,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 02:59:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:59:13,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:59:13,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:59:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 228834432, now seen corresponding path program 9 times [2023-08-31 02:59:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:59:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970728791] [2023-08-31 02:59:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:59:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:59:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:59:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:59:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:59:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970728791] [2023-08-31 02:59:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970728791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:59:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058147490] [2023-08-31 02:59:14,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:59:14,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:59:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:59:14,440 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:59:14,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 02:59:14,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 02:59:14,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:59:14,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-31 02:59:14,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:59:14,809 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 02:59:14,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 02:59:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:59:14,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:59:14,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:59:14,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 02:59:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:59:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058147490] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:59:15,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:59:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-08-31 02:59:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147447863] [2023-08-31 02:59:15,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:59:15,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 02:59:15,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:59:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 02:59:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2023-08-31 02:59:16,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-08-31 02:59:16,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 2713 transitions, 57124 flow. Second operand has 32 states, 32 states have (on average 116.9375) internal successors, (3742), 32 states have internal predecessors, (3742), 0 states have call successors, (0), 0 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-31 02:59:16,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:59:16,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-08-31 02:59:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:59:26,588 INFO L130 PetriNetUnfolder]: 14135/21419 cut-off events. [2023-08-31 02:59:26,588 INFO L131 PetriNetUnfolder]: For 404146/404146 co-relation queries the response was YES. [2023-08-31 02:59:26,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183353 conditions, 21419 events. 14135/21419 cut-off events. For 404146/404146 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 142420 event pairs, 1956 based on Foata normal form. 2/21421 useless extension candidates. Maximal degree in co-relation 182871. Up to 16673 conditions per place. [2023-08-31 02:59:26,856 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 1612 selfloop transitions, 1171 changer transitions 13/2796 dead transitions. [2023-08-31 02:59:26,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 2796 transitions, 63522 flow [2023-08-31 02:59:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-31 02:59:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-31 02:59:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1968 transitions. [2023-08-31 02:59:26,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34844192634560905 [2023-08-31 02:59:26,858 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1968 transitions. [2023-08-31 02:59:26,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1968 transitions. [2023-08-31 02:59:26,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:59:26,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1968 transitions. [2023-08-31 02:59:26,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 123.0) internal successors, (1968), 16 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-31 02:59:26,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 353.0) internal successors, (6001), 17 states have internal predecessors, (6001), 0 states have call successors, (0), 0 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-31 02:59:26,863 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 353.0) internal successors, (6001), 17 states have internal predecessors, (6001), 0 states have call successors, (0), 0 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-31 02:59:26,863 INFO L175 Difference]: Start difference. First operand has 460 places, 2713 transitions, 57124 flow. Second operand 16 states and 1968 transitions. [2023-08-31 02:59:26,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 2796 transitions, 63522 flow [2023-08-31 02:59:37,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2796 transitions, 62301 flow, removed 576 selfloop flow, removed 9 redundant places. [2023-08-31 02:59:37,935 INFO L231 Difference]: Finished difference. Result has 472 places, 2734 transitions, 60370 flow [2023-08-31 02:59:37,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=55903, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=60370, PETRI_PLACES=472, PETRI_TRANSITIONS=2734} [2023-08-31 02:59:37,937 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 439 predicate places. [2023-08-31 02:59:37,937 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 2734 transitions, 60370 flow [2023-08-31 02:59:37,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 116.9375) internal successors, (3742), 32 states have internal predecessors, (3742), 0 states have call successors, (0), 0 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-31 02:59:37,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:59:37,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:59:37,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 02:59:38,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-31 02:59:38,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 02:59:38,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:59:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -475621398, now seen corresponding path program 10 times [2023-08-31 02:59:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:59:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533216863] [2023-08-31 02:59:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:59:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:59:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:59:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:59:38,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:59:38,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533216863] [2023-08-31 02:59:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533216863] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:59:38,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462989973] [2023-08-31 02:59:38,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 02:59:38,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:59:38,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:59:38,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:59:38,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 02:59:38,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 02:59:38,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:59:38,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-31 02:59:38,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:59:39,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:59:39,298 INFO L321 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-08-31 02:59:39,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 29 [2023-08-31 02:59:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:59:39,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:59:39,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:59:39,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 02:59:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:59:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462989973] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:59:39,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:59:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2023-08-31 02:59:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005578913] [2023-08-31 02:59:39,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:59:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 02:59:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:59:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 02:59:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2023-08-31 02:59:41,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 353 [2023-08-31 02:59:41,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 2734 transitions, 60370 flow. Second operand has 37 states, 37 states have (on average 112.72972972972973) internal successors, (4171), 37 states have internal predecessors, (4171), 0 states have call successors, (0), 0 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-31 02:59:41,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:59:41,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 353 [2023-08-31 02:59:41,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:59:52,275 INFO L130 PetriNetUnfolder]: 14151/21465 cut-off events. [2023-08-31 02:59:52,275 INFO L131 PetriNetUnfolder]: For 471086/471086 co-relation queries the response was YES. [2023-08-31 02:59:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189457 conditions, 21465 events. 14151/21465 cut-off events. For 471086/471086 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 143008 event pairs, 1958 based on Foata normal form. 2/21467 useless extension candidates. Maximal degree in co-relation 188995. Up to 16911 conditions per place. [2023-08-31 02:59:52,534 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1529 selfloop transitions, 1265 changer transitions 6/2800 dead transitions. [2023-08-31 02:59:52,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 2800 transitions, 66594 flow [2023-08-31 02:59:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 02:59:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 02:59:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2342 transitions. [2023-08-31 02:59:52,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33172804532577904 [2023-08-31 02:59:52,537 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2342 transitions. [2023-08-31 02:59:52,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2342 transitions. [2023-08-31 02:59:52,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:59:52,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2342 transitions. [2023-08-31 02:59:52,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 117.1) internal successors, (2342), 20 states have internal predecessors, (2342), 0 states have call successors, (0), 0 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-31 02:59:52,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 353.0) internal successors, (7413), 21 states have internal predecessors, (7413), 0 states have call successors, (0), 0 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-31 02:59:52,543 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 353.0) internal successors, (7413), 21 states have internal predecessors, (7413), 0 states have call successors, (0), 0 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-31 02:59:52,543 INFO L175 Difference]: Start difference. First operand has 472 places, 2734 transitions, 60370 flow. Second operand 20 states and 2342 transitions. [2023-08-31 02:59:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 2800 transitions, 66594 flow [2023-08-31 03:00:04,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 2800 transitions, 65912 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-31 03:00:04,243 INFO L231 Difference]: Finished difference. Result has 490 places, 2750 transitions, 63688 flow [2023-08-31 03:00:04,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=59694, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=63688, PETRI_PLACES=490, PETRI_TRANSITIONS=2750} [2023-08-31 03:00:04,245 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 457 predicate places. [2023-08-31 03:00:04,245 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 2750 transitions, 63688 flow [2023-08-31 03:00:04,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 112.72972972972973) internal successors, (4171), 37 states have internal predecessors, (4171), 0 states have call successors, (0), 0 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-31 03:00:04,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:00:04,246 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-31 03:00:04,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 03:00:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-31 03:00:04,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:00:04,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:00:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1967116930, now seen corresponding path program 11 times [2023-08-31 03:00:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:00:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046481118] [2023-08-31 03:00:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:00:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:00:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:00:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:00:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:00:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046481118] [2023-08-31 03:00:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046481118] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:00:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205818699] [2023-08-31 03:00:05,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:00:05,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:00:05,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:00:05,136 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:00:05,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 03:00:05,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:00:05,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:00:05,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 03:00:05,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:00:05,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:05,584 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 27 treesize of output 19 [2023-08-31 03:00:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:05,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:00:05,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:05,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 03:00:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205818699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:00:05,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:00:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-08-31 03:00:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33142974] [2023-08-31 03:00:05,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:00:05,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-31 03:00:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:00:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-31 03:00:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-08-31 03:00:08,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-31 03:00:08,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 2750 transitions, 63688 flow. Second operand has 32 states, 32 states have (on average 114.96875) internal successors, (3679), 32 states have internal predecessors, (3679), 0 states have call successors, (0), 0 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-31 03:00:08,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:00:08,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-31 03:00:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:00:20,988 INFO L130 PetriNetUnfolder]: 12473/19216 cut-off events. [2023-08-31 03:00:20,988 INFO L131 PetriNetUnfolder]: For 473242/473242 co-relation queries the response was YES. [2023-08-31 03:00:21,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175565 conditions, 19216 events. 12473/19216 cut-off events. For 473242/473242 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 130014 event pairs, 1137 based on Foata normal form. 154/19370 useless extension candidates. Maximal degree in co-relation 175231. Up to 10527 conditions per place. [2023-08-31 03:00:21,273 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 830 selfloop transitions, 1712 changer transitions 9/2551 dead transitions. [2023-08-31 03:00:21,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 2551 transitions, 63082 flow [2023-08-31 03:00:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-31 03:00:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-31 03:00:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 5943 transitions. [2023-08-31 03:00:21,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33671388101983 [2023-08-31 03:00:21,277 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 5943 transitions. [2023-08-31 03:00:21,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 5943 transitions. [2023-08-31 03:00:21,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:00:21,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 5943 transitions. [2023-08-31 03:00:21,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 118.86) internal successors, (5943), 50 states have internal predecessors, (5943), 0 states have call successors, (0), 0 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-31 03:00:21,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 353.0) internal successors, (18003), 51 states have internal predecessors, (18003), 0 states have call successors, (0), 0 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-31 03:00:21,293 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 353.0) internal successors, (18003), 51 states have internal predecessors, (18003), 0 states have call successors, (0), 0 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-31 03:00:21,293 INFO L175 Difference]: Start difference. First operand has 490 places, 2750 transitions, 63688 flow. Second operand 50 states and 5943 transitions. [2023-08-31 03:00:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 2551 transitions, 63082 flow [2023-08-31 03:00:30,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2551 transitions, 61834 flow, removed 103 selfloop flow, removed 21 redundant places. [2023-08-31 03:00:30,811 INFO L231 Difference]: Finished difference. Result has 509 places, 2401 transitions, 62267 flow [2023-08-31 03:00:30,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=50404, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=62267, PETRI_PLACES=509, PETRI_TRANSITIONS=2401} [2023-08-31 03:00:30,813 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 476 predicate places. [2023-08-31 03:00:30,813 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 2401 transitions, 62267 flow [2023-08-31 03:00:30,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 114.96875) internal successors, (3679), 32 states have internal predecessors, (3679), 0 states have call successors, (0), 0 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-31 03:00:30,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:00:30,814 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-31 03:00:30,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-31 03:00:31,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-31 03:00:31,014 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:00:31,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:00:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash -625829824, now seen corresponding path program 12 times [2023-08-31 03:00:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:00:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503915648] [2023-08-31 03:00:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:00:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:00:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:00:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:00:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:00:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503915648] [2023-08-31 03:00:31,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503915648] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:00:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681419129] [2023-08-31 03:00:31,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:00:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:00:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:00:31,710 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:00:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-31 03:00:31,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 03:00:31,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:00:31,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-31 03:00:31,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:00:32,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:32,111 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 27 treesize of output 19 [2023-08-31 03:00:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:32,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:00:32,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:32,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 03:00:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681419129] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:00:32,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:00:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 31 [2023-08-31 03:00:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529522658] [2023-08-31 03:00:32,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:00:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 03:00:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:00:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 03:00:32,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2023-08-31 03:00:33,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-31 03:00:33,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 2401 transitions, 62267 flow. Second operand has 33 states, 33 states have (on average 114.81818181818181) internal successors, (3789), 33 states have internal predecessors, (3789), 0 states have call successors, (0), 0 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-31 03:00:33,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:00:33,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-31 03:00:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:00:43,761 INFO L130 PetriNetUnfolder]: 12557/19374 cut-off events. [2023-08-31 03:00:43,761 INFO L131 PetriNetUnfolder]: For 550924/550924 co-relation queries the response was YES. [2023-08-31 03:00:43,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188622 conditions, 19374 events. 12557/19374 cut-off events. For 550924/550924 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 131925 event pairs, 1756 based on Foata normal form. 2/19376 useless extension candidates. Maximal degree in co-relation 188123. Up to 14976 conditions per place. [2023-08-31 03:00:44,007 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1287 selfloop transitions, 1212 changer transitions 6/2505 dead transitions. [2023-08-31 03:00:44,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 2505 transitions, 69142 flow [2023-08-31 03:00:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 03:00:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 03:00:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2383 transitions. [2023-08-31 03:00:44,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33753541076487253 [2023-08-31 03:00:44,009 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2383 transitions. [2023-08-31 03:00:44,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2383 transitions. [2023-08-31 03:00:44,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:00:44,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2383 transitions. [2023-08-31 03:00:44,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 119.15) internal successors, (2383), 20 states have internal predecessors, (2383), 0 states have call successors, (0), 0 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-31 03:00:44,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 353.0) internal successors, (7413), 21 states have internal predecessors, (7413), 0 states have call successors, (0), 0 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-31 03:00:44,014 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 353.0) internal successors, (7413), 21 states have internal predecessors, (7413), 0 states have call successors, (0), 0 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-31 03:00:44,015 INFO L175 Difference]: Start difference. First operand has 509 places, 2401 transitions, 62267 flow. Second operand 20 states and 2383 transitions. [2023-08-31 03:00:44,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 2505 transitions, 69142 flow [2023-08-31 03:00:54,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 2505 transitions, 68696 flow, removed 168 selfloop flow, removed 11 redundant places. [2023-08-31 03:00:54,579 INFO L231 Difference]: Finished difference. Result has 522 places, 2454 transitions, 66979 flow [2023-08-31 03:00:54,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=61851, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=66979, PETRI_PLACES=522, PETRI_TRANSITIONS=2454} [2023-08-31 03:00:54,581 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 489 predicate places. [2023-08-31 03:00:54,581 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 2454 transitions, 66979 flow [2023-08-31 03:00:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 114.81818181818181) internal successors, (3789), 33 states have internal predecessors, (3789), 0 states have call successors, (0), 0 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-31 03:00:54,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:00:54,582 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-31 03:00:54,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-31 03:00:54,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-31 03:00:54,783 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:00:54,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:00:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1375121970, now seen corresponding path program 13 times [2023-08-31 03:00:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:00:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008420402] [2023-08-31 03:00:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:00:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:00:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:00:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:00:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:00:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008420402] [2023-08-31 03:00:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008420402] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:00:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439402985] [2023-08-31 03:00:55,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:00:55,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:00:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:00:55,663 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:00:55,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-31 03:00:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:00:55,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-31 03:00:55,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:00:56,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:56,153 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 27 treesize of output 19 [2023-08-31 03:00:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:56,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:00:56,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:00:56,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 03:00:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:00:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439402985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:00:56,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:00:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2023-08-31 03:00:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112071486] [2023-08-31 03:00:56,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:00:56,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-31 03:00:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:00:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-31 03:00:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2023-08-31 03:00:57,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-08-31 03:00:57,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 2454 transitions, 66979 flow. Second operand has 29 states, 29 states have (on average 118.03448275862068) internal successors, (3423), 29 states have internal predecessors, (3423), 0 states have call successors, (0), 0 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-31 03:00:57,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:00:57,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-08-31 03:00:57,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:01:09,519 INFO L130 PetriNetUnfolder]: 13523/20972 cut-off events. [2023-08-31 03:01:09,520 INFO L131 PetriNetUnfolder]: For 721329/721508 co-relation queries the response was YES. [2023-08-31 03:01:09,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212303 conditions, 20972 events. 13523/20972 cut-off events. For 721329/721508 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 148777 event pairs, 2087 based on Foata normal form. 102/21032 useless extension candidates. Maximal degree in co-relation 211808. Up to 16106 conditions per place. [2023-08-31 03:01:09,838 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1653 selfloop transitions, 1149 changer transitions 1/2835 dead transitions. [2023-08-31 03:01:09,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2835 transitions, 80586 flow [2023-08-31 03:01:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-31 03:01:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-31 03:01:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3684 transitions. [2023-08-31 03:01:09,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34787535410764875 [2023-08-31 03:01:09,841 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3684 transitions. [2023-08-31 03:01:09,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3684 transitions. [2023-08-31 03:01:09,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:01:09,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3684 transitions. [2023-08-31 03:01:09,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 122.8) internal successors, (3684), 30 states have internal predecessors, (3684), 0 states have call successors, (0), 0 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-31 03:01:09,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 353.0) internal successors, (10943), 31 states have internal predecessors, (10943), 0 states have call successors, (0), 0 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-31 03:01:09,852 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 353.0) internal successors, (10943), 31 states have internal predecessors, (10943), 0 states have call successors, (0), 0 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-31 03:01:09,852 INFO L175 Difference]: Start difference. First operand has 522 places, 2454 transitions, 66979 flow. Second operand 30 states and 3684 transitions. [2023-08-31 03:01:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 2835 transitions, 80586 flow [2023-08-31 03:01:21,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 2835 transitions, 79801 flow, removed 28 selfloop flow, removed 12 redundant places. [2023-08-31 03:01:21,429 INFO L231 Difference]: Finished difference. Result has 544 places, 2668 transitions, 75354 flow [2023-08-31 03:01:21,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=66232, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=949, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=75354, PETRI_PLACES=544, PETRI_TRANSITIONS=2668} [2023-08-31 03:01:21,431 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-31 03:01:21,431 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 2668 transitions, 75354 flow [2023-08-31 03:01:21,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.03448275862068) internal successors, (3423), 29 states have internal predecessors, (3423), 0 states have call successors, (0), 0 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-31 03:01:21,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:01:21,432 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-31 03:01:21,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-31 03:01:21,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:01:21,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:01:21,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:01:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1253047374, now seen corresponding path program 14 times [2023-08-31 03:01:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:01:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830435518] [2023-08-31 03:01:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:01:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:01:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:01:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:01:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:01:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830435518] [2023-08-31 03:01:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830435518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:01:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656086730] [2023-08-31 03:01:22,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:01:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:01:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:01:22,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:01:22,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-31 03:01:22,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:01:22,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:01:22,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 03:01:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:01:22,479 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-31 03:01:22,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-08-31 03:01:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:01:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:01:22,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:01:22,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2023-08-31 03:01:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:01:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656086730] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:01:22,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:01:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-08-31 03:01:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35398550] [2023-08-31 03:01:22,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:01:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-31 03:01:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:01:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-31 03:01:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-08-31 03:01:23,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 353 [2023-08-31 03:01:23,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 2668 transitions, 75354 flow. Second operand has 25 states, 25 states have (on average 124.04) internal successors, (3101), 25 states have internal predecessors, (3101), 0 states have call successors, (0), 0 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-31 03:01:23,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:01:23,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 353 [2023-08-31 03:01:23,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:01:36,509 INFO L130 PetriNetUnfolder]: 14315/22175 cut-off events. [2023-08-31 03:01:36,509 INFO L131 PetriNetUnfolder]: For 760067/760251 co-relation queries the response was YES. [2023-08-31 03:01:36,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231015 conditions, 22175 events. 14315/22175 cut-off events. For 760067/760251 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 158588 event pairs, 1416 based on Foata normal form. 106/22237 useless extension candidates. Maximal degree in co-relation 230504. Up to 13586 conditions per place. [2023-08-31 03:01:36,856 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1101 selfloop transitions, 1751 changer transitions 6/2890 dead transitions. [2023-08-31 03:01:36,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2890 transitions, 84916 flow [2023-08-31 03:01:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-31 03:01:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-31 03:01:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3371 transitions. [2023-08-31 03:01:36,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36729134887775117 [2023-08-31 03:01:36,860 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3371 transitions. [2023-08-31 03:01:36,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3371 transitions. [2023-08-31 03:01:36,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:01:36,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3371 transitions. [2023-08-31 03:01:36,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 129.65384615384616) internal successors, (3371), 26 states have internal predecessors, (3371), 0 states have call successors, (0), 0 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-31 03:01:36,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 353.0) internal successors, (9531), 27 states have internal predecessors, (9531), 0 states have call successors, (0), 0 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-31 03:01:36,870 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 353.0) internal successors, (9531), 27 states have internal predecessors, (9531), 0 states have call successors, (0), 0 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-31 03:01:36,870 INFO L175 Difference]: Start difference. First operand has 544 places, 2668 transitions, 75354 flow. Second operand 26 states and 3371 transitions. [2023-08-31 03:01:36,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 2890 transitions, 84916 flow [2023-08-31 03:01:50,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 2890 transitions, 84753 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-08-31 03:01:50,107 INFO L231 Difference]: Finished difference. Result has 567 places, 2767 transitions, 82041 flow [2023-08-31 03:01:50,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=75191, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=82041, PETRI_PLACES=567, PETRI_TRANSITIONS=2767} [2023-08-31 03:01:50,109 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 534 predicate places. [2023-08-31 03:01:50,110 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 2767 transitions, 82041 flow [2023-08-31 03:01:50,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 124.04) internal successors, (3101), 25 states have internal predecessors, (3101), 0 states have call successors, (0), 0 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-31 03:01:50,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:01:50,110 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-31 03:01:50,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-31 03:01:50,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-31 03:01:50,313 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:01:50,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:01:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1650705045, now seen corresponding path program 15 times [2023-08-31 03:01:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:01:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881444919] [2023-08-31 03:01:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:01:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:01:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:01:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:01:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:01:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881444919] [2023-08-31 03:01:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881444919] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:01:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562697005] [2023-08-31 03:01:50,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:01:50,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:01:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:01:50,397 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:01:50,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-31 03:01:50,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:01:50,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:01:50,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 03:01:50,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:01:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:01:50,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:01:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:01:50,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562697005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:01:50,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:01:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-31 03:01:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293248] [2023-08-31 03:01:50,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:01:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 03:01:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:01:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 03:01:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-08-31 03:01:50,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-31 03:01:50,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 2767 transitions, 82041 flow. Second operand has 14 states, 14 states have (on average 147.0) internal successors, (2058), 14 states have internal predecessors, (2058), 0 states have call successors, (0), 0 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-31 03:01:50,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:01:50,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-31 03:01:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:02:03,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([872] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_5| |v_thread2Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_5| |v_thread2Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_7| |v_thread2Thread1of1ForFork0_plus_#res#1_5|) (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_21| 4))) (+ (select (select |v_#memory_int_76| v_~B~0.base_44) (+ v_~B~0.offset_44 .cse0)) (select (select |v_#memory_int_76| v_~A~0.base_40) (+ v_~A~0.offset_40 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_5|) (= (ite (or (<= .cse1 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| 2147483647) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| |v_thread2Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_5| v_~res2~0_39) (< |v_thread2Thread1of1ForFork0_~i~1#1_21| v_~M~0_13) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_5|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_5| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| 2147483648)))) InVars {~A~0.base=v_~A~0.base_40, ~B~0.base=v_~B~0.base_44, ~A~0.offset=v_~A~0.offset_40, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_76|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_21|, ~B~0.offset=v_~B~0.offset_44, ~res2~0=v_~res2~0_39} OutVars{~A~0.base=v_~A~0.base_40, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_5|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_5|, ~B~0.base=v_~B~0.base_44, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_21|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_5|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_40, ~M~0=v_~M~0_13, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_5|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_5|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_7|, #memory_int=|v_#memory_int_76|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_5|, ~B~0.offset=v_~B~0.offset_44, ~res2~0=v_~res2~0_39} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1][179], [2308#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 3245#true, 3685#true, Black: 1064#(and (= ~res2~0 ~res1~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 919#(and (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1)), 108#L101-2true, Black: 1048#(and (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1)), Black: 1032#(and (= ~res2~0 ~res1~0) (or (and (< ~N~0 2) (< 0 ~N~0)) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 860#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1060#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (< 0 ~N~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), 1404#true, Black: 3883#(and (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1) (or (< 0 (+ ~M~0 1)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 3808#(or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3891#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~res2~0 ~res1~0)), Black: 3889#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (or (< 0 (+ ~M~0 1)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (< 0 ~N~0)), Black: 3696#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3885#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0) (<= ~N~0 1) (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (and (< 0 (+ ~M~0 1)) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)))), Black: 634#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 810#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 812#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 714#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 834#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), 2963#true, Black: 814#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 816#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 635#(= ~res2~0 ~res1~0), Black: 570#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0) (<= ~M~0 0)), Black: 582#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (< 0 ~N~0)), Black: 592#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 568#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0)), 358#true, Black: 3594#(= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 366#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 600#(and (= ~res2~0 ~res1~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) ~res1~0))), Black: 3471#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 3672#(and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 548#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (<= 1 ~N~0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 586#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3474#(= ~res2~0 ~res1~0), Black: 3522#(and (exists ((|thread3Thread1of1ForFork1_~i~2#1| Int)) (and (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), 850#true, Black: 404#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0)), Black: 355#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), Black: 590#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (< 0 ~N~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) ~res1~0))), Black: 1934#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 367#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 578#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1332#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 1336#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 0 ~N~0)), Black: 580#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (< 0 ~N~0)), Black: 1988#(= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 1286#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (or (<= (+ ~M~0 1) 0) (and (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~M~0 1) 0) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (<= (+ ~M~0 1) 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2122#(and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| ~M~0) (< ~N~0 2) (= ~M~0 0)), Black: 1340#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2120#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1151#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 1072#true, Black: 2124#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), Black: 2142#(and (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 1312#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (< 0 ~N~0)), Black: 1352#(and (= ~res2~0 ~res1~0) (or (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2108#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2144#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 1288#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1368#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 1935#(= ~res2~0 ~res1~0), Black: 1294#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (<= (+ ~M~0 1) 0) (and (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~M~0 1) 0) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (<= (+ ~M~0 1) 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1320#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 1147#(and (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 0 ~N~0)), Black: 1318#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1304#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1087#(= ~res2~0 ~res1~0), Black: 1324#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|))), Black: 1086#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1829#(and (= ~res2~0 ~res1~0) (< ~N~0 2) (< 0 ~N~0)), Black: 1688#(and (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 1628#(and (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (<= ~N~0 1) (< 0 ~N~0)), Black: 1690#(= ~res2~0 ~res1~0), Black: 1419#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3316#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0)))), Black: 1640#(and (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 2 ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (< 0 ~N~0)), Black: 1905#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1602#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1885#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3451#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 1883#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1536#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 3453#(and (= ~res2~0 ~res1~0) (< 0 ~N~0)), Black: 1901#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3449#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 1646#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (<= ~N~0 1) (< 0 ~N~0)), Black: 1879#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1648#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (<= ~N~0 1) (< 0 ~N~0)), Black: 1532#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1618#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|))), 104#L64true, Black: 2957#(and (= ~res2~0 ~res1~0) (< 0 ~N~0)), Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_71| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4)) (select (select |#memory_int| ~A~0.base) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4) ~A~0.offset)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_71| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_71| 1)))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 2953#(and (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (or (= ~A~0.offset 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_71| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4)) (select (select |#memory_int| ~A~0.base) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4) ~A~0.offset)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_71| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_71| 1))))), 2741#true, Black: 3106#(and (= ~res2~0 ~res1~0) (< ~N~0 2) (< 0 ~N~0)), Black: 3190#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (< 0 ~N~0)), Black: 3224#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~res2~0 ~res1~0)), Black: 3037#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), 3460#true, Black: 3178#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), Black: 3033#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 2976#(and (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), Black: 3168#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3188#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1924#true, Black: 3164#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3180#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3158#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3172#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3208#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3192#(and (or (= ~res2~0 ~res1~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 3182#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3196#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3166#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2731#(and (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 2610#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 2545#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 2733#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2546#(= ~res2~0 ~res1~0), 85#L74-4true, Black: 182#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0)), Black: 191#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 619#true, Black: 2413#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2371#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2243#(and (<= 1 ~N~0) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), Black: 2397#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2379#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (or (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~M~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2235#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), Black: 2423#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), 1215#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 2429#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (and (<= ~N~0 1) (or (not (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (= ~res2~0 0)))) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), 3905#(<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|), Black: 2457#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), 1674#true, Black: 2421#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (<= 1 ~N~0) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 2411#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2493#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2163#true, Black: 2441#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2239#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), 2530#true]) [2023-08-31 03:02:03,575 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 03:02:03,575 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 03:02:03,575 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 03:02:03,575 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 03:02:05,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([872] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_5| |v_thread2Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_5| |v_thread2Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_7| |v_thread2Thread1of1ForFork0_plus_#res#1_5|) (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_21| 4))) (+ (select (select |v_#memory_int_76| v_~B~0.base_44) (+ v_~B~0.offset_44 .cse0)) (select (select |v_#memory_int_76| v_~A~0.base_40) (+ v_~A~0.offset_40 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_5|) (= (ite (or (<= .cse1 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| 2147483647) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| |v_thread2Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_5| v_~res2~0_39) (< |v_thread2Thread1of1ForFork0_~i~1#1_21| v_~M~0_13) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_5|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_5| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_5| 2147483648)))) InVars {~A~0.base=v_~A~0.base_40, ~B~0.base=v_~B~0.base_44, ~A~0.offset=v_~A~0.offset_40, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_76|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_21|, ~B~0.offset=v_~B~0.offset_44, ~res2~0=v_~res2~0_39} OutVars{~A~0.base=v_~A~0.base_40, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_5|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_5|, ~B~0.base=v_~B~0.base_44, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_21|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_5|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_40, ~M~0=v_~M~0_13, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_5|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_5|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_7|, #memory_int=|v_#memory_int_76|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_5|, ~B~0.offset=v_~B~0.offset_44, ~res2~0=v_~res2~0_39} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1][179], [2308#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 3245#true, 3685#true, Black: 1064#(and (= ~res2~0 ~res1~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 919#(and (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1)), Black: 1048#(and (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1)), Black: 1032#(and (= ~res2~0 ~res1~0) (or (and (< ~N~0 2) (< 0 ~N~0)) (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 860#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1060#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (< 0 ~N~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), 1404#true, Black: 3883#(and (<= 1 ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (<= ~N~0 1) (or (< 0 (+ ~M~0 1)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 3808#(or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3891#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~res2~0 ~res1~0)), Black: 3889#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (or (< 0 (+ ~M~0 1)) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (< 0 ~N~0)), Black: 3696#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3885#(and (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~N~0) (<= ~N~0 1) (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (and (< 0 (+ ~M~0 1)) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)))), Black: 634#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 810#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 812#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 714#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 834#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), 2963#true, Black: 814#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 816#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 635#(= ~res2~0 ~res1~0), Black: 570#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0) (<= ~M~0 0)), Black: 582#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (< 0 ~N~0)), Black: 592#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 568#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0)), 358#true, Black: 3594#(= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 366#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 600#(and (= ~res2~0 ~res1~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) ~res1~0))), Black: 3471#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 3672#(and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 548#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |#StackHeapBarrier|) (<= 1 ~N~0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 586#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 3474#(= ~res2~0 ~res1~0), Black: 3522#(and (exists ((|thread3Thread1of1ForFork1_~i~2#1| Int)) (and (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|))) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), 850#true, Black: 404#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (= ~res2~0 0) (< 0 ~N~0)), Black: 355#(and (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0)), Black: 590#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= ~N~0 1) (< 0 ~N~0) (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) (select (select |#memory_int| ~B~0.base) (+ ~B~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) ~res1~0))), Black: 1934#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 367#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 578#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1332#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 1336#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 0 ~N~0)), Black: 580#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res1~0) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= (+ 2 ~B~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (< 0 ~N~0)), Black: 1988#(= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|), Black: 1286#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (or (<= (+ ~M~0 1) 0) (and (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~M~0 1) 0) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (<= (+ ~M~0 1) 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 2122#(and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| ~M~0) (< ~N~0 2) (= ~M~0 0)), Black: 1340#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2120#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1151#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 2124#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), Black: 1072#true, Black: 2142#(and (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), Black: 1312#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (< 0 ~N~0)), Black: 1352#(and (= ~res2~0 ~res1~0) (or (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2108#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2144#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 1288#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1368#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< |thread3Thread1of1ForFork1_~i~2#1| 0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 1935#(= ~res2~0 ~res1~0), Black: 1294#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (<= (+ ~M~0 1) 0) (and (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~M~0 1) 0) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)))) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (<= (+ ~M~0 1) 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (< 0 (+ ~M~0 1)) (<= 1 ~N~0))), Black: 1320#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 1147#(and (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (< 0 ~N~0)), Black: 1318#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1304#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1087#(= ~res2~0 ~res1~0), Black: 1324#(and (or (and (= ~res2~0 ~res1~0) (= |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|)) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|))), Black: 1086#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1829#(and (= ~res2~0 ~res1~0) (< ~N~0 2) (< 0 ~N~0)), Black: 1688#(and (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 1628#(and (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (not (= |thread3Thread1of1ForFork1_~i~2#1| 0))) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (<= ~N~0 1) (< 0 ~N~0)), Black: 1690#(= ~res2~0 ~res1~0), Black: 1419#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 3316#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0)))), Black: 1640#(and (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|)) (or (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 2 ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))) (< 0 ~N~0)), Black: 1905#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1602#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~M~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1885#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3451#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 1883#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1536#(or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)), Black: 3453#(and (= ~res2~0 ~res1~0) (< 0 ~N~0)), Black: 1901#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3449#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_79| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_79| 1)) (<= |v_thread3Thread1of1ForFork1_~i~2#1_79| 0) (= (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_79| 4))) ~res2~0))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 1646#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (<= ~N~0 1) (< 0 ~N~0)), Black: 1879#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1648#(and (<= |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 ~res1~0) (<= |thread1Thread1of1ForFork2_~i~0#1| 1) (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (<= ~N~0 1) (< 0 ~N~0)), Black: 1532#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1618#(and (or (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|) (= (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork1_~tmp~2#1|)) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork2_~i~0#1| |thread3Thread1of1ForFork1_~i~2#1|) (< |thread3Thread1of1ForFork1_~i~2#1| |thread1Thread1of1ForFork2_~i~0#1|))), 104#L64true, Black: 2957#(and (= ~res2~0 ~res1~0) (< 0 ~N~0)), Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_71| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4)) (select (select |#memory_int| ~A~0.base) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4) ~A~0.offset)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_71| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_71| 1)))) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)), Black: 2953#(and (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (or (= ~A~0.offset 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_71| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4)) (select (select |#memory_int| ~A~0.base) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_71| 4) ~A~0.offset)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_71| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_71| 1))))), 2741#true, Black: 3106#(and (= ~res2~0 ~res1~0) (< ~N~0 2) (< 0 ~N~0)), Black: 3190#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (< 0 ~N~0)), Black: 3224#(and (or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~res2~0 ~res1~0)), Black: 3037#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), 3460#true, Black: 3178#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) ~B~0.offset) ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))))), Black: 3033#(and (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 2976#(and (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), Black: 3168#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3188#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1924#true, Black: 3164#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3180#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |thread3Thread1of1ForFork1_~tmp~2#1| (+ (select (select |#memory_int| ~B~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) (select (select |#memory_int| ~A~0.base) (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3158#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3172#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3208#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3192#(and (or (= ~res2~0 ~res1~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (= ~A~0.offset 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_75| Int)) (and (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_75| 4)))) (< |v_thread3Thread1of1ForFork1_~i~2#1_75| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_75| 1)))) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (< 0 ~N~0)), Black: 3182#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~N~0 1) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 ~N~0) (<= ~M~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3196#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3166#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res1~0 0) (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2731#(and (or (= ~res1~0 |thread3Thread1of1ForFork1_~tmp~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0)) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 2610#(and (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< 0 ~N~0)), Black: 2545#(or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 2733#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2546#(= ~res2~0 ~res1~0), 85#L74-4true, Black: 182#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0)), Black: 191#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 619#true, Black: 2413#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2371#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2243#(and (<= 1 ~N~0) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0))), Black: 2397#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2379#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (or (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~B~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~M~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (not (= ~B~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~res2~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2235#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), Black: 2423#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 2429#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (and (<= ~N~0 1) (or (not (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (= ~res2~0 0)))) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), 1215#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< |thread3Thread1of1ForFork1_~i~2#1| 0)), 3905#(<= ~N~0 |thread1Thread1of1ForFork2_~i~0#1|), Black: 2457#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork1_~i~2#1| 0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))), 22#L102-1true, 1674#true, Black: 2421#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~B~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~B~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))))) (<= 1 ~N~0) (or (and (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (and (= ~res1~0 0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)))), Black: 2411#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2493#(and (= ~res2~0 ~res1~0) (< 0 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 1)), Black: 2163#true, Black: 2441#(and (<= 0 |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~B~0.base) 0) (select (select |#memory_int| ~A~0.base) 0)) ~res2~0)) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~M~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= ~res1~0 0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2239#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= 1 ~N~0) (= ~res1~0 0) (exists ((|v_thread3Thread1of1ForFork1_~i~2#1_63| Int)) (and (<= |thread3Thread1of1ForFork1_~i~2#1| (+ |v_thread3Thread1of1ForFork1_~i~2#1_63| 1)) (= ~res2~0 (+ (select (select |#memory_int| ~B~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)) (select (select |#memory_int| ~A~0.base) (* |v_thread3Thread1of1ForFork1_~i~2#1_63| 4)))) (<= |v_thread3Thread1of1ForFork1_~i~2#1_63| 0)))), 2530#true]) [2023-08-31 03:02:05,673 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 03:02:05,673 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 03:02:05,673 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 03:02:05,673 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 03:02:09,392 INFO L130 PetriNetUnfolder]: 20257/32768 cut-off events. [2023-08-31 03:02:09,392 INFO L131 PetriNetUnfolder]: For 1480218/1481229 co-relation queries the response was YES. [2023-08-31 03:02:09,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359962 conditions, 32768 events. 20257/32768 cut-off events. For 1480218/1481229 co-relation queries the response was YES. Maximal size of possible extension queue 2092. Compared 265571 event pairs, 4377 based on Foata normal form. 2548/34981 useless extension candidates. Maximal degree in co-relation 359490. Up to 13290 conditions per place. [2023-08-31 03:02:09,986 INFO L137 encePairwiseOnDemand]: 345/353 looper letters, 3012 selfloop transitions, 546 changer transitions 68/3702 dead transitions. [2023-08-31 03:02:09,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 3702 transitions, 119734 flow [2023-08-31 03:02:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 03:02:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 03:02:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1864 transitions. [2023-08-31 03:02:09,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4400377714825307 [2023-08-31 03:02:09,988 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1864 transitions. [2023-08-31 03:02:09,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1864 transitions. [2023-08-31 03:02:09,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:02:09,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1864 transitions. [2023-08-31 03:02:09,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 155.33333333333334) internal successors, (1864), 12 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-31 03:02:09,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 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-31 03:02:09,991 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 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-31 03:02:09,991 INFO L175 Difference]: Start difference. First operand has 567 places, 2767 transitions, 82041 flow. Second operand 12 states and 1864 transitions. [2023-08-31 03:02:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 3702 transitions, 119734 flow [2023-08-31 03:02:38,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 3702 transitions, 118377 flow, removed 159 selfloop flow, removed 18 redundant places. [2023-08-31 03:02:38,115 INFO L231 Difference]: Finished difference. Result has 557 places, 2481 transitions, 76277 flow [2023-08-31 03:02:38,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=71853, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=76277, PETRI_PLACES=557, PETRI_TRANSITIONS=2481} [2023-08-31 03:02:38,118 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 524 predicate places. [2023-08-31 03:02:38,118 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 2481 transitions, 76277 flow [2023-08-31 03:02:38,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 147.0) internal successors, (2058), 14 states have internal predecessors, (2058), 0 states have call successors, (0), 0 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-31 03:02:38,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:02:38,118 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-31 03:02:38,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-31 03:02:38,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 03:02:38,324 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:02:38,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:02:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 823383047, now seen corresponding path program 16 times [2023-08-31 03:02:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:02:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358179554] [2023-08-31 03:02:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:02:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:02:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:02:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:02:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:02:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358179554] [2023-08-31 03:02:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358179554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:02:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353244834] [2023-08-31 03:02:38,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:02:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:02:38,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:02:38,419 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:02:38,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-31 03:02:38,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:02:38,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:02:38,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 03:02:38,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:02:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:02:38,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:02:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:02:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353244834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:02:38,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:02:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-08-31 03:02:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738469381] [2023-08-31 03:02:38,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:02:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-31 03:02:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:02:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-31 03:02:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-31 03:02:39,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:02:39,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 2481 transitions, 76277 flow. Second operand has 19 states, 19 states have (on average 140.89473684210526) internal successors, (2677), 19 states have internal predecessors, (2677), 0 states have call successors, (0), 0 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-31 03:02:39,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:02:39,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:02:39,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:02:59,642 INFO L130 PetriNetUnfolder]: 24038/38189 cut-off events. [2023-08-31 03:02:59,642 INFO L131 PetriNetUnfolder]: For 1552510/1552650 co-relation queries the response was YES. [2023-08-31 03:03:00,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414670 conditions, 38189 events. 24038/38189 cut-off events. For 1552510/1552650 co-relation queries the response was YES. Maximal size of possible extension queue 2230. Compared 303089 event pairs, 2478 based on Foata normal form. 162/38286 useless extension candidates. Maximal degree in co-relation 414389. Up to 12412 conditions per place. [2023-08-31 03:03:00,402 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1488 selfloop transitions, 2652 changer transitions 9/4248 dead transitions. [2023-08-31 03:03:00,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 4248 transitions, 131236 flow [2023-08-31 03:03:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-31 03:03:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-31 03:03:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4708 transitions. [2023-08-31 03:03:00,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41678470254957506 [2023-08-31 03:03:00,405 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4708 transitions. [2023-08-31 03:03:00,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4708 transitions. [2023-08-31 03:03:00,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:03:00,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4708 transitions. [2023-08-31 03:03:00,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 147.125) internal successors, (4708), 32 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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-31 03:03:00,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 353.0) internal successors, (11649), 33 states have internal predecessors, (11649), 0 states have call successors, (0), 0 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-31 03:03:00,413 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 353.0) internal successors, (11649), 33 states have internal predecessors, (11649), 0 states have call successors, (0), 0 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-31 03:03:00,413 INFO L175 Difference]: Start difference. First operand has 557 places, 2481 transitions, 76277 flow. Second operand 32 states and 4708 transitions. [2023-08-31 03:03:00,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 4248 transitions, 131236 flow [2023-08-31 03:03:30,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 4248 transitions, 127925 flow, removed 595 selfloop flow, removed 36 redundant places. [2023-08-31 03:03:30,339 INFO L231 Difference]: Finished difference. Result has 544 places, 3644 transitions, 118305 flow [2023-08-31 03:03:30,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=58724, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=118305, PETRI_PLACES=544, PETRI_TRANSITIONS=3644} [2023-08-31 03:03:30,340 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-31 03:03:30,341 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 3644 transitions, 118305 flow [2023-08-31 03:03:30,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 140.89473684210526) internal successors, (2677), 19 states have internal predecessors, (2677), 0 states have call successors, (0), 0 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-31 03:03:30,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:03:30,341 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, 1] [2023-08-31 03:03:30,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-31 03:03:30,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:03:30,542 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:03:30,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:03:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 358970001, now seen corresponding path program 1 times [2023-08-31 03:03:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:03:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681479541] [2023-08-31 03:03:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:03:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:03:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:03:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:03:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:03:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681479541] [2023-08-31 03:03:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681479541] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:03:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683911021] [2023-08-31 03:03:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:03:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:03:30,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:03:30,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:03:30,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-31 03:03:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:03:30,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:03:30,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:03:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:03:30,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:03:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:03:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683911021] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:03:30,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:03:30,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-08-31 03:03:30,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655346025] [2023-08-31 03:03:30,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:03:30,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-31 03:03:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:03:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-31 03:03:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-08-31 03:03:31,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:03:31,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 3644 transitions, 118305 flow. Second operand has 17 states, 17 states have (on average 140.7058823529412) internal successors, (2392), 17 states have internal predecessors, (2392), 0 states have call successors, (0), 0 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-31 03:03:31,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:03:31,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:03:31,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:04:00,928 INFO L130 PetriNetUnfolder]: 27149/43154 cut-off events. [2023-08-31 03:04:00,928 INFO L131 PetriNetUnfolder]: For 2086351/2086517 co-relation queries the response was YES. [2023-08-31 03:04:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512412 conditions, 43154 events. 27149/43154 cut-off events. For 2086351/2086517 co-relation queries the response was YES. Maximal size of possible extension queue 2504. Compared 347658 event pairs, 3637 based on Foata normal form. 168/43278 useless extension candidates. Maximal degree in co-relation 512107. Up to 14156 conditions per place. [2023-08-31 03:04:02,036 INFO L137 encePairwiseOnDemand]: 343/353 looper letters, 3689 selfloop transitions, 1164 changer transitions 82/5034 dead transitions. [2023-08-31 03:04:02,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 5034 transitions, 167769 flow [2023-08-31 03:04:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-31 03:04:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-31 03:04:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3854 transitions. [2023-08-31 03:04:02,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41991719328829813 [2023-08-31 03:04:02,039 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3854 transitions. [2023-08-31 03:04:02,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3854 transitions. [2023-08-31 03:04:02,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:04:02,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3854 transitions. [2023-08-31 03:04:02,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 148.23076923076923) internal successors, (3854), 26 states have internal predecessors, (3854), 0 states have call successors, (0), 0 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-31 03:04:02,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 353.0) internal successors, (9531), 27 states have internal predecessors, (9531), 0 states have call successors, (0), 0 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-31 03:04:02,045 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 353.0) internal successors, (9531), 27 states have internal predecessors, (9531), 0 states have call successors, (0), 0 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-31 03:04:02,045 INFO L175 Difference]: Start difference. First operand has 544 places, 3644 transitions, 118305 flow. Second operand 26 states and 3854 transitions. [2023-08-31 03:04:02,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 5034 transitions, 167769 flow [2023-08-31 03:04:49,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 5034 transitions, 166844 flow, removed 458 selfloop flow, removed 4 redundant places. [2023-08-31 03:04:50,007 INFO L231 Difference]: Finished difference. Result has 579 places, 4094 transitions, 134332 flow [2023-08-31 03:04:50,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=117444, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=700, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=134332, PETRI_PLACES=579, PETRI_TRANSITIONS=4094} [2023-08-31 03:04:50,009 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 546 predicate places. [2023-08-31 03:04:50,009 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 4094 transitions, 134332 flow [2023-08-31 03:04:50,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 140.7058823529412) internal successors, (2392), 17 states have internal predecessors, (2392), 0 states have call successors, (0), 0 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-31 03:04:50,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:04:50,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-31 03:04:50,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-31 03:04:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:04:50,211 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:04:50,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:04:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 978819407, now seen corresponding path program 17 times [2023-08-31 03:04:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:04:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099578629] [2023-08-31 03:04:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:04:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:04:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:04:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:04:50,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:04:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099578629] [2023-08-31 03:04:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099578629] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:04:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748577008] [2023-08-31 03:04:50,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:04:50,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:04:50,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:04:50,292 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:04:50,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-31 03:04:50,403 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:04:50,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:04:50,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 03:04:50,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:04:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:04:50,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:04:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:04:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748577008] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:04:50,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:04:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-08-31 03:04:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825180929] [2023-08-31 03:04:50,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:04:50,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 03:04:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:04:50,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 03:04:50,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-31 03:04:50,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-31 03:04:50,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 4094 transitions, 134332 flow. Second operand has 15 states, 15 states have (on average 146.93333333333334) internal successors, (2204), 15 states have internal predecessors, (2204), 0 states have call successors, (0), 0 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-31 03:04:50,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:04:50,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-31 03:04:50,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:05:12,695 INFO L130 PetriNetUnfolder]: 16856/26602 cut-off events. [2023-08-31 03:05:12,695 INFO L131 PetriNetUnfolder]: For 1306540/1306992 co-relation queries the response was YES. [2023-08-31 03:05:13,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337297 conditions, 26602 events. 16856/26602 cut-off events. For 1306540/1306992 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 200705 event pairs, 4437 based on Foata normal form. 2047/28441 useless extension candidates. Maximal degree in co-relation 337090. Up to 12871 conditions per place. [2023-08-31 03:05:13,189 INFO L137 encePairwiseOnDemand]: 346/353 looper letters, 2255 selfloop transitions, 230 changer transitions 1099/3645 dead transitions. [2023-08-31 03:05:13,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 3645 transitions, 122238 flow [2023-08-31 03:05:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:05:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:05:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2023-08-31 03:05:13,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43590651558073656 [2023-08-31 03:05:13,190 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1231 transitions. [2023-08-31 03:05:13,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1231 transitions. [2023-08-31 03:05:13,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:05:13,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1231 transitions. [2023-08-31 03:05:13,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 153.875) internal successors, (1231), 8 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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-31 03:05:13,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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-31 03:05:13,192 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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-31 03:05:13,193 INFO L175 Difference]: Start difference. First operand has 579 places, 4094 transitions, 134332 flow. Second operand 8 states and 1231 transitions. [2023-08-31 03:05:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 3645 transitions, 122238 flow [2023-08-31 03:05:34,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 3645 transitions, 119491 flow, removed 478 selfloop flow, removed 15 redundant places. [2023-08-31 03:05:34,679 INFO L231 Difference]: Finished difference. Result has 568 places, 2332 transitions, 71897 flow [2023-08-31 03:05:34,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=104905, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=71897, PETRI_PLACES=568, PETRI_TRANSITIONS=2332} [2023-08-31 03:05:34,681 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 535 predicate places. [2023-08-31 03:05:34,681 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 2332 transitions, 71897 flow [2023-08-31 03:05:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 146.93333333333334) internal successors, (2204), 15 states have internal predecessors, (2204), 0 states have call successors, (0), 0 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-31 03:05:34,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:05:34,681 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, 1] [2023-08-31 03:05:34,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-31 03:05:34,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:05:34,882 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:05:34,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:05:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1527957887, now seen corresponding path program 2 times [2023-08-31 03:05:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:05:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639789929] [2023-08-31 03:05:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:05:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:05:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:05:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:05:34,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:05:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639789929] [2023-08-31 03:05:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639789929] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:05:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218527192] [2023-08-31 03:05:34,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:05:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:05:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:05:34,968 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:05:34,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-31 03:05:35,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:05:35,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:05:35,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:05:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:05:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:05:35,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:05:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:05:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218527192] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:05:35,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:05:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-08-31 03:05:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248964685] [2023-08-31 03:05:35,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:05:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 03:05:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:05:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 03:05:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-08-31 03:05:35,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:05:35,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 2332 transitions, 71897 flow. Second operand has 18 states, 18 states have (on average 140.5) internal successors, (2529), 18 states have internal predecessors, (2529), 0 states have call successors, (0), 0 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-31 03:05:35,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:05:35,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:05:35,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:05:50,465 INFO L130 PetriNetUnfolder]: 17629/28087 cut-off events. [2023-08-31 03:05:50,465 INFO L131 PetriNetUnfolder]: For 1405878/1406052 co-relation queries the response was YES. [2023-08-31 03:05:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331811 conditions, 28087 events. 17629/28087 cut-off events. For 1405878/1406052 co-relation queries the response was YES. Maximal size of possible extension queue 1694. Compared 214429 event pairs, 1680 based on Foata normal form. 606/28680 useless extension candidates. Maximal degree in co-relation 331668. Up to 9711 conditions per place. [2023-08-31 03:05:50,915 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 2658 selfloop transitions, 483 changer transitions 49/3253 dead transitions. [2023-08-31 03:05:50,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 3253 transitions, 103279 flow [2023-08-31 03:05:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 03:05:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 03:05:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3097 transitions. [2023-08-31 03:05:50,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41777957641980307 [2023-08-31 03:05:50,918 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3097 transitions. [2023-08-31 03:05:50,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3097 transitions. [2023-08-31 03:05:50,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:05:50,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3097 transitions. [2023-08-31 03:05:50,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 147.47619047619048) internal successors, (3097), 21 states have internal predecessors, (3097), 0 states have call successors, (0), 0 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-31 03:05:50,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 353.0) internal successors, (7766), 22 states have internal predecessors, (7766), 0 states have call successors, (0), 0 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-31 03:05:50,923 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 353.0) internal successors, (7766), 22 states have internal predecessors, (7766), 0 states have call successors, (0), 0 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-31 03:05:50,923 INFO L175 Difference]: Start difference. First operand has 568 places, 2332 transitions, 71897 flow. Second operand 21 states and 3097 transitions. [2023-08-31 03:05:50,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 3253 transitions, 103279 flow [2023-08-31 03:06:08,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 3253 transitions, 100197 flow, removed 356 selfloop flow, removed 23 redundant places. [2023-08-31 03:06:08,696 INFO L231 Difference]: Finished difference. Result has 556 places, 2550 transitions, 77485 flow [2023-08-31 03:06:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=68987, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=77485, PETRI_PLACES=556, PETRI_TRANSITIONS=2550} [2023-08-31 03:06:08,697 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 523 predicate places. [2023-08-31 03:06:08,697 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 2550 transitions, 77485 flow [2023-08-31 03:06:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.5) internal successors, (2529), 18 states have internal predecessors, (2529), 0 states have call successors, (0), 0 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-31 03:06:08,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:06:08,698 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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-31 03:06:08,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-31 03:06:08,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-31 03:06:08,898 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:06:08,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:06:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash -485434675, now seen corresponding path program 18 times [2023-08-31 03:06:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:06:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712049724] [2023-08-31 03:06:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:06:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:06:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:06:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:06:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712049724] [2023-08-31 03:06:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712049724] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:06:08,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764485885] [2023-08-31 03:06:08,991 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:06:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:06:08,992 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:06:08,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-31 03:06:09,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-31 03:06:09,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:06:09,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 03:06:09,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:06:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:09,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:06:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764485885] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:06:09,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:06:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-08-31 03:06:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895521522] [2023-08-31 03:06:09,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:06:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 03:06:09,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:06:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 03:06:09,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-08-31 03:06:09,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 353 [2023-08-31 03:06:09,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 2550 transitions, 77485 flow. Second operand has 15 states, 15 states have (on average 145.33333333333334) internal successors, (2180), 15 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-31 03:06:09,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:06:09,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 353 [2023-08-31 03:06:09,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:06:20,135 INFO L130 PetriNetUnfolder]: 11887/19805 cut-off events. [2023-08-31 03:06:20,135 INFO L131 PetriNetUnfolder]: For 928771/929124 co-relation queries the response was YES. [2023-08-31 03:06:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221008 conditions, 19805 events. 11887/19805 cut-off events. For 928771/929124 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 154577 event pairs, 2208 based on Foata normal form. 1114/20847 useless extension candidates. Maximal degree in co-relation 220868. Up to 8109 conditions per place. [2023-08-31 03:06:20,413 INFO L137 encePairwiseOnDemand]: 344/353 looper letters, 1654 selfloop transitions, 167 changer transitions 179/2081 dead transitions. [2023-08-31 03:06:20,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 2081 transitions, 62266 flow [2023-08-31 03:06:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 03:06:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 03:06:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1505 transitions. [2023-08-31 03:06:20,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263456090651558 [2023-08-31 03:06:20,415 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1505 transitions. [2023-08-31 03:06:20,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1505 transitions. [2023-08-31 03:06:20,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:06:20,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1505 transitions. [2023-08-31 03:06:20,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.5) internal successors, (1505), 10 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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-31 03:06:20,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 353.0) internal successors, (3883), 11 states have internal predecessors, (3883), 0 states have call successors, (0), 0 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-31 03:06:20,418 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 353.0) internal successors, (3883), 11 states have internal predecessors, (3883), 0 states have call successors, (0), 0 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-31 03:06:20,418 INFO L175 Difference]: Start difference. First operand has 556 places, 2550 transitions, 77485 flow. Second operand 10 states and 1505 transitions. [2023-08-31 03:06:20,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 2081 transitions, 62266 flow [2023-08-31 03:06:28,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 2081 transitions, 60641 flow, removed 301 selfloop flow, removed 10 redundant places. [2023-08-31 03:06:28,884 INFO L231 Difference]: Finished difference. Result has 544 places, 1850 transitions, 51127 flow [2023-08-31 03:06:28,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=55806, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=51127, PETRI_PLACES=544, PETRI_TRANSITIONS=1850} [2023-08-31 03:06:28,885 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-31 03:06:28,885 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 1850 transitions, 51127 flow [2023-08-31 03:06:28,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 145.33333333333334) internal successors, (2180), 15 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-31 03:06:28,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:06:28,885 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, 1] [2023-08-31 03:06:28,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-31 03:06:29,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-31 03:06:29,086 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:06:29,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:06:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 955848005, now seen corresponding path program 3 times [2023-08-31 03:06:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:06:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418880502] [2023-08-31 03:06:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:06:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:06:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:06:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:06:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418880502] [2023-08-31 03:06:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418880502] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:06:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732110457] [2023-08-31 03:06:29,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:06:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:06:29,174 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:06:29,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-31 03:06:29,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:06:29,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:06:29,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:06:29,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:06:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:29,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:06:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732110457] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:06:29,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:06:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-08-31 03:06:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637006071] [2023-08-31 03:06:29,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:06:29,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 03:06:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:06:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 03:06:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-08-31 03:06:29,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:06:29,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1850 transitions, 51127 flow. Second operand has 18 states, 18 states have (on average 140.94444444444446) internal successors, (2537), 18 states have internal predecessors, (2537), 0 states have call successors, (0), 0 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-31 03:06:29,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:06:29,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:06:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:06:38,384 INFO L130 PetriNetUnfolder]: 11295/18824 cut-off events. [2023-08-31 03:06:38,385 INFO L131 PetriNetUnfolder]: For 676170/676362 co-relation queries the response was YES. [2023-08-31 03:06:38,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198956 conditions, 18824 events. 11295/18824 cut-off events. For 676170/676362 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 145453 event pairs, 1341 based on Foata normal form. 130/18940 useless extension candidates. Maximal degree in co-relation 198817. Up to 6221 conditions per place. [2023-08-31 03:06:38,640 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1708 selfloop transitions, 470 changer transitions 106/2333 dead transitions. [2023-08-31 03:06:38,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 2333 transitions, 65367 flow [2023-08-31 03:06:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-31 03:06:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-31 03:06:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3256 transitions. [2023-08-31 03:06:38,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192634560906516 [2023-08-31 03:06:38,642 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3256 transitions. [2023-08-31 03:06:38,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3256 transitions. [2023-08-31 03:06:38,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:06:38,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3256 transitions. [2023-08-31 03:06:38,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 148.0) internal successors, (3256), 22 states have internal predecessors, (3256), 0 states have call successors, (0), 0 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-31 03:06:38,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 353.0) internal successors, (8119), 23 states have internal predecessors, (8119), 0 states have call successors, (0), 0 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-31 03:06:38,647 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 353.0) internal successors, (8119), 23 states have internal predecessors, (8119), 0 states have call successors, (0), 0 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-31 03:06:38,647 INFO L175 Difference]: Start difference. First operand has 544 places, 1850 transitions, 51127 flow. Second operand 22 states and 3256 transitions. [2023-08-31 03:06:38,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 2333 transitions, 65367 flow [2023-08-31 03:06:45,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 2333 transitions, 63972 flow, removed 229 selfloop flow, removed 30 redundant places. [2023-08-31 03:06:45,105 INFO L231 Difference]: Finished difference. Result has 527 places, 1823 transitions, 50287 flow [2023-08-31 03:06:45,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=48990, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=464, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=50287, PETRI_PLACES=527, PETRI_TRANSITIONS=1823} [2023-08-31 03:06:45,107 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 494 predicate places. [2023-08-31 03:06:45,107 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 1823 transitions, 50287 flow [2023-08-31 03:06:45,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.94444444444446) internal successors, (2537), 18 states have internal predecessors, (2537), 0 states have call successors, (0), 0 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-31 03:06:45,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:06:45,107 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, 1] [2023-08-31 03:06:45,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-31 03:06:45,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:45,313 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:06:45,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:06:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1680272153, now seen corresponding path program 4 times [2023-08-31 03:06:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:06:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887581241] [2023-08-31 03:06:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:06:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:06:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:06:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:06:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887581241] [2023-08-31 03:06:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887581241] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:06:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56901556] [2023-08-31 03:06:45,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:06:45,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:45,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:06:45,389 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:06:45,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-31 03:06:45,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:06:45,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:06:45,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:06:45,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:06:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:45,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:06:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 03:06:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56901556] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:06:45,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:06:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-31 03:06:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646491831] [2023-08-31 03:06:45,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:06:45,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 03:06:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:06:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 03:06:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-31 03:06:45,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:06:45,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 1823 transitions, 50287 flow. Second operand has 18 states, 18 states have (on average 140.83333333333334) internal successors, (2535), 18 states have internal predecessors, (2535), 0 states have call successors, (0), 0 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-31 03:06:45,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:06:45,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:06:45,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:06:52,701 INFO L130 PetriNetUnfolder]: 9248/15262 cut-off events. [2023-08-31 03:06:52,701 INFO L131 PetriNetUnfolder]: For 524239/524471 co-relation queries the response was YES. [2023-08-31 03:06:52,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164401 conditions, 15262 events. 9248/15262 cut-off events. For 524239/524471 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 112183 event pairs, 1193 based on Foata normal form. 307/15560 useless extension candidates. Maximal degree in co-relation 164270. Up to 5340 conditions per place. [2023-08-31 03:06:52,900 INFO L137 encePairwiseOnDemand]: 342/353 looper letters, 1472 selfloop transitions, 314 changer transitions 133/1960 dead transitions. [2023-08-31 03:06:52,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 1960 transitions, 56262 flow [2023-08-31 03:06:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-31 03:06:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-31 03:06:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2353 transitions. [2023-08-31 03:06:52,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41660764872521244 [2023-08-31 03:06:52,902 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2353 transitions. [2023-08-31 03:06:52,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2353 transitions. [2023-08-31 03:06:52,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:06:52,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2353 transitions. [2023-08-31 03:06:52,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 147.0625) internal successors, (2353), 16 states have internal predecessors, (2353), 0 states have call successors, (0), 0 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-31 03:06:52,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 353.0) internal successors, (6001), 17 states have internal predecessors, (6001), 0 states have call successors, (0), 0 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-31 03:06:52,906 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 353.0) internal successors, (6001), 17 states have internal predecessors, (6001), 0 states have call successors, (0), 0 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-31 03:06:52,906 INFO L175 Difference]: Start difference. First operand has 527 places, 1823 transitions, 50287 flow. Second operand 16 states and 2353 transitions. [2023-08-31 03:06:52,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 1960 transitions, 56262 flow [2023-08-31 03:06:57,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 1960 transitions, 54956 flow, removed 109 selfloop flow, removed 22 redundant places. [2023-08-31 03:06:57,289 INFO L231 Difference]: Finished difference. Result has 512 places, 1594 transitions, 43703 flow [2023-08-31 03:06:57,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=43548, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=43703, PETRI_PLACES=512, PETRI_TRANSITIONS=1594} [2023-08-31 03:06:57,290 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 479 predicate places. [2023-08-31 03:06:57,290 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1594 transitions, 43703 flow [2023-08-31 03:06:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.83333333333334) internal successors, (2535), 18 states have internal predecessors, (2535), 0 states have call successors, (0), 0 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-31 03:06:57,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:06:57,291 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, 1] [2023-08-31 03:06:57,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-31 03:06:57,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:57,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:06:57,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:06:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1224659079, now seen corresponding path program 5 times [2023-08-31 03:06:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:06:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909159913] [2023-08-31 03:06:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:06:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:06:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:06:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:06:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909159913] [2023-08-31 03:06:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909159913] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:06:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584799680] [2023-08-31 03:06:57,571 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:06:57,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:06:57,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:06:57,573 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:06:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-31 03:06:57,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:06:57,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:06:57,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:06:57,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:06:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:57,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:06:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:06:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584799680] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:06:57,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:06:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-08-31 03:06:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823134293] [2023-08-31 03:06:57,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:06:57,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 03:06:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:06:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 03:06:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-08-31 03:06:58,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:06:58,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1594 transitions, 43703 flow. Second operand has 16 states, 16 states have (on average 140.5625) internal successors, (2249), 16 states have internal predecessors, (2249), 0 states have call successors, (0), 0 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-31 03:06:58,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:06:58,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:06:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:07:01,945 INFO L130 PetriNetUnfolder]: 6345/10131 cut-off events. [2023-08-31 03:07:01,945 INFO L131 PetriNetUnfolder]: For 368886/369138 co-relation queries the response was YES. [2023-08-31 03:07:02,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113460 conditions, 10131 events. 6345/10131 cut-off events. For 368886/369138 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 65340 event pairs, 785 based on Foata normal form. 479/10603 useless extension candidates. Maximal degree in co-relation 113336. Up to 4182 conditions per place. [2023-08-31 03:07:02,066 INFO L137 encePairwiseOnDemand]: 343/353 looper letters, 1081 selfloop transitions, 94 changer transitions 190/1392 dead transitions. [2023-08-31 03:07:02,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1392 transitions, 40181 flow [2023-08-31 03:07:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 03:07:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 03:07:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1746 transitions. [2023-08-31 03:07:02,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121813031161473 [2023-08-31 03:07:02,068 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1746 transitions. [2023-08-31 03:07:02,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1746 transitions. [2023-08-31 03:07:02,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:07:02,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1746 transitions. [2023-08-31 03:07:02,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 145.5) internal successors, (1746), 12 states have internal predecessors, (1746), 0 states have call successors, (0), 0 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-31 03:07:02,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 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-31 03:07:02,071 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 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-31 03:07:02,071 INFO L175 Difference]: Start difference. First operand has 512 places, 1594 transitions, 43703 flow. Second operand 12 states and 1746 transitions. [2023-08-31 03:07:02,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1392 transitions, 40181 flow [2023-08-31 03:07:04,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 1392 transitions, 38776 flow, removed 170 selfloop flow, removed 48 redundant places. [2023-08-31 03:07:04,604 INFO L231 Difference]: Finished difference. Result has 430 places, 1082 transitions, 29096 flow [2023-08-31 03:07:04,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=32389, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=29096, PETRI_PLACES=430, PETRI_TRANSITIONS=1082} [2023-08-31 03:07:04,605 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 397 predicate places. [2023-08-31 03:07:04,605 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1082 transitions, 29096 flow [2023-08-31 03:07:04,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 140.5625) internal successors, (2249), 16 states have internal predecessors, (2249), 0 states have call successors, (0), 0 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-31 03:07:04,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:07:04,606 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-31 03:07:04,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-31 03:07:04,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-31 03:07:04,813 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:07:04,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:07:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1272059176, now seen corresponding path program 19 times [2023-08-31 03:07:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:07:04,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610993938] [2023-08-31 03:07:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:07:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:07:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:07:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:04,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:07:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610993938] [2023-08-31 03:07:04,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610993938] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:07:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587278411] [2023-08-31 03:07:04,909 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:07:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:07:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:07:04,910 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:07:04,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-31 03:07:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:07:05,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 03:07:05,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:07:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:05,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:07:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587278411] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:07:05,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:07:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-08-31 03:07:05,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669171003] [2023-08-31 03:07:05,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:07:05,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:07:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:07:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:07:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:07:05,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:07:05,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1082 transitions, 29096 flow. Second operand has 20 states, 20 states have (on average 140.75) internal successors, (2815), 20 states have internal predecessors, (2815), 0 states have call successors, (0), 0 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-31 03:07:05,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:07:05,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:07:05,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:07:10,405 INFO L130 PetriNetUnfolder]: 9241/14091 cut-off events. [2023-08-31 03:07:10,405 INFO L131 PetriNetUnfolder]: For 505440/505814 co-relation queries the response was YES. [2023-08-31 03:07:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163938 conditions, 14091 events. 9241/14091 cut-off events. For 505440/505814 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 89752 event pairs, 397 based on Foata normal form. 132/14204 useless extension candidates. Maximal degree in co-relation 163837. Up to 6508 conditions per place. [2023-08-31 03:07:10,594 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 805 selfloop transitions, 1154 changer transitions 0/1986 dead transitions. [2023-08-31 03:07:10,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1986 transitions, 55031 flow [2023-08-31 03:07:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-31 03:07:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-31 03:07:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4255 transitions. [2023-08-31 03:07:10,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41564911595193904 [2023-08-31 03:07:10,596 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4255 transitions. [2023-08-31 03:07:10,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4255 transitions. [2023-08-31 03:07:10,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:07:10,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4255 transitions. [2023-08-31 03:07:10,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 146.72413793103448) internal successors, (4255), 29 states have internal predecessors, (4255), 0 states have call successors, (0), 0 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-31 03:07:10,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 353.0) internal successors, (10590), 30 states have internal predecessors, (10590), 0 states have call successors, (0), 0 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-31 03:07:10,603 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 353.0) internal successors, (10590), 30 states have internal predecessors, (10590), 0 states have call successors, (0), 0 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-31 03:07:10,604 INFO L175 Difference]: Start difference. First operand has 430 places, 1082 transitions, 29096 flow. Second operand 29 states and 4255 transitions. [2023-08-31 03:07:10,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1986 transitions, 55031 flow [2023-08-31 03:07:13,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1986 transitions, 50286 flow, removed 348 selfloop flow, removed 26 redundant places. [2023-08-31 03:07:13,954 INFO L231 Difference]: Finished difference. Result has 358 places, 1562 transitions, 42785 flow [2023-08-31 03:07:13,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=26534, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=705, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=42785, PETRI_PLACES=358, PETRI_TRANSITIONS=1562} [2023-08-31 03:07:13,955 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 325 predicate places. [2023-08-31 03:07:13,955 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1562 transitions, 42785 flow [2023-08-31 03:07:13,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 140.75) internal successors, (2815), 20 states have internal predecessors, (2815), 0 states have call successors, (0), 0 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-31 03:07:13,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:07:13,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-31 03:07:13,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-31 03:07:14,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-31 03:07:14,156 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:07:14,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:07:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1741797494, now seen corresponding path program 20 times [2023-08-31 03:07:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:07:14,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310826136] [2023-08-31 03:07:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:07:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:07:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:07:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:07:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310826136] [2023-08-31 03:07:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310826136] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:07:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901120497] [2023-08-31 03:07:14,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:07:14,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:07:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:07:14,246 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:07:14,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-31 03:07:14,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:07:14,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:07:14,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 03:07:14,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:07:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:14,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:07:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901120497] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:07:14,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:07:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-08-31 03:07:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517503148] [2023-08-31 03:07:14,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:07:14,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:07:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:07:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:07:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:07:14,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:07:14,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1562 transitions, 42785 flow. Second operand has 20 states, 20 states have (on average 140.5) internal successors, (2810), 20 states have internal predecessors, (2810), 0 states have call successors, (0), 0 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-31 03:07:14,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:07:14,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:07:14,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:07:22,561 INFO L130 PetriNetUnfolder]: 13610/20685 cut-off events. [2023-08-31 03:07:22,562 INFO L131 PetriNetUnfolder]: For 708543/708947 co-relation queries the response was YES. [2023-08-31 03:07:22,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231206 conditions, 20685 events. 13610/20685 cut-off events. For 708543/708947 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 136697 event pairs, 644 based on Foata normal form. 126/20784 useless extension candidates. Maximal degree in co-relation 231106. Up to 9581 conditions per place. [2023-08-31 03:07:22,818 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 1257 selfloop transitions, 1285 changer transitions 0/2569 dead transitions. [2023-08-31 03:07:22,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2569 transitions, 69197 flow [2023-08-31 03:07:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-31 03:07:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-31 03:07:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5889 transitions. [2023-08-31 03:07:22,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41706798866855527 [2023-08-31 03:07:22,822 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 5889 transitions. [2023-08-31 03:07:22,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 5889 transitions. [2023-08-31 03:07:22,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:07:22,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 5889 transitions. [2023-08-31 03:07:22,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 147.225) internal successors, (5889), 40 states have internal predecessors, (5889), 0 states have call successors, (0), 0 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-31 03:07:22,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 0 states have call successors, (0), 0 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-31 03:07:22,832 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 0 states have call successors, (0), 0 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-31 03:07:22,832 INFO L175 Difference]: Start difference. First operand has 358 places, 1562 transitions, 42785 flow. Second operand 40 states and 5889 transitions. [2023-08-31 03:07:22,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 2569 transitions, 69197 flow [2023-08-31 03:07:29,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 2569 transitions, 67600 flow, removed 242 selfloop flow, removed 5 redundant places. [2023-08-31 03:07:29,918 INFO L231 Difference]: Finished difference. Result has 410 places, 1925 transitions, 56251 flow [2023-08-31 03:07:29,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=41782, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=955, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=56251, PETRI_PLACES=410, PETRI_TRANSITIONS=1925} [2023-08-31 03:07:29,920 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 377 predicate places. [2023-08-31 03:07:29,920 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1925 transitions, 56251 flow [2023-08-31 03:07:29,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 140.5) internal successors, (2810), 20 states have internal predecessors, (2810), 0 states have call successors, (0), 0 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-31 03:07:29,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:07:29,924 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-31 03:07:29,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-31 03:07:30,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-31 03:07:30,129 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:07:30,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:07:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -720657816, now seen corresponding path program 21 times [2023-08-31 03:07:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:07:30,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22912334] [2023-08-31 03:07:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:07:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:07:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:07:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:07:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22912334] [2023-08-31 03:07:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22912334] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:07:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171473884] [2023-08-31 03:07:30,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:07:30,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:07:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:07:30,214 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:07:30,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-31 03:07:30,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:07:30,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:07:30,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 03:07:30,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:07:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:30,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:07:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 03:07:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171473884] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:07:30,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:07:30,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-08-31 03:07:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838847512] [2023-08-31 03:07:30,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:07:30,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 03:07:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:07:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 03:07:30,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-08-31 03:07:30,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-31 03:07:30,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1925 transitions, 56251 flow. Second operand has 18 states, 18 states have (on average 140.77777777777777) internal successors, (2534), 18 states have internal predecessors, (2534), 0 states have call successors, (0), 0 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-31 03:07:30,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:07:30,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-31 03:07:30,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15