./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:35:59,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:35:59,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:35:59,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:35:59,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:35:59,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:35:59,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:35:59,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:35:59,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:35:59,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:35:59,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:35:59,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:35:59,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:35:59,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:35:59,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:35:59,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:35:59,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:35:59,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:35:59,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:35:59,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:35:59,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:35:59,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:35:59,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:35:59,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:35:59,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:35:59,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:35:59,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:35:59,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:35:59,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:35:59,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:35:59,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:35:59,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:35:59,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:35:59,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:35:59,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:35:59,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:35:59,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:35:59,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:35:59,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:35:59,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:35:59,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:35:59,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:35:59,813 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:35:59,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:35:59,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:35:59,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:35:59,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:35:59,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:35:59,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:35:59,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:35:59,817 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:35:59,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:35:59,818 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:35:59,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:35:59,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:35:59,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:35:59,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:35:59,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:35:59,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:35:59,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:35:59,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:35:59,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:35:59,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:35:59,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:35:59,822 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:35:59,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:35:59,822 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:35:59,822 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 -> AFTER [2023-08-30 20:36:00,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:36:00,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:36:00,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:36:00,177 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:36:00,178 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:36:00,179 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-30 20:36:01,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:36:01,535 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:36:01,535 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-30 20:36:01,547 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f99bffe/e58bbcb4c96a4c0ebd6feb1878f92c6b/FLAG26c8b9ae4 [2023-08-30 20:36:01,558 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f99bffe/e58bbcb4c96a4c0ebd6feb1878f92c6b [2023-08-30 20:36:01,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:36:01,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:36:01,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:36:01,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:36:01,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:36:01,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fddfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01, skipping insertion in model container [2023-08-30 20:36:01,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:36:01,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:36:01,726 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-30 20:36:01,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:36:01,742 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:36:01,761 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-30 20:36:01,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:36:01,772 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:36:01,772 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:36:01,778 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:36:01,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01 WrapperNode [2023-08-30 20:36:01,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:36:01,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:36:01,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:36:01,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:36:01,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,847 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 284 [2023-08-30 20:36:01,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:36:01,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:36:01,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:36:01,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:36:01,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:36:01,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:36:01,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:36:01,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:36:01,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (1/1) ... [2023-08-30 20:36:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:36:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:36:01,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 20:36:01,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 20:36:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:36:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:36:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:36:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:36:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:36:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:36:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:36:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:36:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:36:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:36:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:36:01,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:36:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:36:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:36:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:36:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:36:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:36:01,979 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:36:02,137 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:36:02,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:36:02,510 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:36:02,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:36:02,799 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-30 20:36:02,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:36:02 BoogieIcfgContainer [2023-08-30 20:36:02,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:36:02,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:36:02,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:36:02,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:36:02,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:36:01" (1/3) ... [2023-08-30 20:36:02,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e38c09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:36:02, skipping insertion in model container [2023-08-30 20:36:02,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:36:01" (2/3) ... [2023-08-30 20:36:02,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e38c09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:36:02, skipping insertion in model container [2023-08-30 20:36:02,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:36:02" (3/3) ... [2023-08-30 20:36:02,809 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-08-30 20:36:02,817 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:36:02,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:36:02,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:36:02,826 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:36:02,909 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 20:36:02,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 183 transitions, 390 flow [2023-08-30 20:36:03,028 INFO L130 PetriNetUnfolder]: 16/180 cut-off events. [2023-08-30 20:36:03,029 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:36:03,034 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-30 20:36:03,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 183 transitions, 390 flow [2023-08-30 20:36:03,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 170 transitions, 358 flow [2023-08-30 20:36:03,045 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:36:03,061 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 170 transitions, 358 flow [2023-08-30 20:36:03,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 170 transitions, 358 flow [2023-08-30 20:36:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 358 flow [2023-08-30 20:36:03,091 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2023-08-30 20:36:03,092 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:36:03,093 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-30 20:36:03,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-08-30 20:36:08,740 INFO L134 LiptonReduction]: Checked pairs total: 2268 [2023-08-30 20:36:08,741 INFO L136 LiptonReduction]: Total number of compositions: 170 [2023-08-30 20:36:08,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:36:08,758 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;@2b0084f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:36:08,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 20:36:08,765 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-08-30 20:36:08,766 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:36:08,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:36:08,766 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-30 20:36:08,767 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-30 20:36:08,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:36:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2134572771, now seen corresponding path program 1 times [2023-08-30 20:36:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:36:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539768874] [2023-08-30 20:36:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:36:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:36:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:36:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539768874] [2023-08-30 20:36:09,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539768874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:36:09,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:36:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 20:36:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721169079] [2023-08-30 20:36:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:36:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:36:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:36:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:36:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:36:09,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 353 [2023-08-30 20:36:09,437 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-30 20:36:09,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:36:09,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 353 [2023-08-30 20:36:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:36:09,701 INFO L130 PetriNetUnfolder]: 531/736 cut-off events. [2023-08-30 20:36:09,701 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 20:36:09,706 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-30 20:36:09,713 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-30 20:36:09,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 176 flow [2023-08-30 20:36:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:36:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:36:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-08-30 20:36:09,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660056657223796 [2023-08-30 20:36:09,734 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-08-30 20:36:09,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-08-30 20:36:09,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:36:09,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-08-30 20:36:09,743 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-30 20:36:09,748 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-30 20:36:09,749 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-30 20:36:09,750 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 4 states and 658 transitions. [2023-08-30 20:36:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 176 flow [2023-08-30 20:36:09,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 20:36:09,756 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 83 flow [2023-08-30 20:36:09,758 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-30 20:36:09,761 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-30 20:36:09,761 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 83 flow [2023-08-30 20:36:09,762 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-30 20:36:09,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:36:09,762 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-30 20:36:09,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:36:09,763 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-30 20:36:09,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:36:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1985121884, now seen corresponding path program 1 times [2023-08-30 20:36:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:36:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392554339] [2023-08-30 20:36:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:36:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:36:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:36:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392554339] [2023-08-30 20:36:10,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392554339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:36:10,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:36:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 20:36:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006843103] [2023-08-30 20:36:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:36:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 20:36:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:36:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 20:36:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 20:36:10,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 353 [2023-08-30 20:36:10,218 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-30 20:36:10,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:36:10,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 353 [2023-08-30 20:36:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:36:10,397 INFO L130 PetriNetUnfolder]: 532/741 cut-off events. [2023-08-30 20:36:10,397 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2023-08-30 20:36:10,398 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-30 20:36:10,401 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 34 selfloop transitions, 5 changer transitions 3/44 dead transitions. [2023-08-30 20:36:10,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 199 flow [2023-08-30 20:36:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:36:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:36:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2023-08-30 20:36:10,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343720491029273 [2023-08-30 20:36:10,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 920 transitions. [2023-08-30 20:36:10,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 920 transitions. [2023-08-30 20:36:10,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:36:10,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 920 transitions. [2023-08-30 20:36:10,409 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-30 20:36:10,412 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-30 20:36:10,414 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-30 20:36:10,414 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 83 flow. Second operand 6 states and 920 transitions. [2023-08-30 20:36:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 199 flow [2023-08-30 20:36:10,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 20:36:10,416 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 109 flow [2023-08-30 20:36:10,417 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-30 20:36:10,417 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-08-30 20:36:10,417 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 109 flow [2023-08-30 20:36:10,418 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-30 20:36:10,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:36:10,418 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-30 20:36:10,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:36:10,419 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-30 20:36:10,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:36:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 963886311, now seen corresponding path program 1 times [2023-08-30 20:36:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:36:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113251320] [2023-08-30 20:36:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:36:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:10,520 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-30 20:36:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:36:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113251320] [2023-08-30 20:36:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113251320] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:36:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71579598] [2023-08-30 20:36:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:10,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:36:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:36:10,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:36:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 20:36:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:10,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 20:36:10,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:36:10,767 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-30 20:36:10,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:36:10,816 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-30 20:36:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71579598] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 20:36:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 20:36:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-30 20:36:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015746921] [2023-08-30 20:36:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:36:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:36:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:36:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:36:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-30 20:36:10,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-30 20:36:10,925 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-30 20:36:10,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:36:10,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-30 20:36:10,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:36:11,098 INFO L130 PetriNetUnfolder]: 508/732 cut-off events. [2023-08-30 20:36:11,099 INFO L131 PetriNetUnfolder]: For 179/215 co-relation queries the response was YES. [2023-08-30 20:36:11,100 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-30 20:36:11,103 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-30 20:36:11,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 233 flow [2023-08-30 20:36:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:36:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:36:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-08-30 20:36:11,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43059490084985835 [2023-08-30 20:36:11,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-08-30 20:36:11,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-08-30 20:36:11,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:36:11,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-08-30 20:36:11,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-30 20:36:11,112 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-30 20:36:11,113 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-30 20:36:11,114 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 109 flow. Second operand 5 states and 760 transitions. [2023-08-30 20:36:11,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 233 flow [2023-08-30 20:36:11,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 227 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 20:36:11,117 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 119 flow [2023-08-30 20:36:11,117 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-30 20:36:11,118 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-30 20:36:11,118 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 119 flow [2023-08-30 20:36:11,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-30 20:36:11,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:36:11,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:36:11,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 20:36:11,325 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-30 20:36:11,325 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-30 20:36:11,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:36:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1831077328, now seen corresponding path program 1 times [2023-08-30 20:36:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:36:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258480720] [2023-08-30 20:36:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:36:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:13,351 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-30 20:36:13,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:36:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258480720] [2023-08-30 20:36:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258480720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:36:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025898664] [2023-08-30 20:36:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:36:13,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:36:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:36:13,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:36:13,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 20:36:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:36:13,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 81 conjunts are in the unsatisfiable core [2023-08-30 20:36:13,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:36:13,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:36:13,848 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-30 20:36:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:36:14,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:36:14,136 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 20:36:14,137 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-30 20:36:14,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:36:14,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:36:14,304 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 20:36:14,305 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-30 20:36:14,443 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:36:14,444 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-30 20:36:14,613 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-30 20:36:14,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:36:14,820 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-30 20:36:14,893 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-30 20:36:15,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:36:15,260 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-30 20:36:15,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:36:15,406 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-30 20:36:16,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:36:16,087 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-30 20:36:16,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:36:16,140 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-30 20:36:16,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:36:16,228 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-30 20:36:26,843 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:28,454 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:29,335 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:29,438 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:29,793 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:30,119 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:30,270 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:30,375 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:30,425 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:30,478 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:30,706 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:31,105 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:31,307 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:31,648 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:32,537 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:32,749 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:32,984 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:33,096 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:33,255 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:33,703 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:33,758 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:33,873 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:34,133 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:34,191 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:34,351 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:34,398 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:34,457 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:34,570 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:34,746 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:35,494 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:35,622 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:35,687 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:35,746 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:35,753 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:36,253 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:36,287 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:36,359 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:36,411 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:38,583 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:38,693 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:38,718 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:39,119 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:39,133 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:39,320 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:39,355 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:40,027 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:40,388 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:40,847 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:41,065 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:41,082 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:41,215 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:41,968 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:41,989 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:42,142 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:42,360 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:42,375 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:42,544 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:42,876 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:43,201 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:43,280 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:44,176 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:45,000 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:45,727 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:36:47,242 WARN L718 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-30 20:36:47,447 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:48,099 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:36:48,398 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:48,483 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:48,809 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:48,864 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:48,925 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:48,942 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:49,309 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:49,530 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:49,850 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:50,019 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:50,530 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:50,611 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:50,696 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:50,859 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:51,151 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:51,743 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:51,846 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:51,893 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:52,174 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:52,267 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:52,345 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:52,417 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:52,561 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:52,631 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:53,019 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:53,094 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:53,184 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:53,266 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:36:53,718 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:53,776 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:53,806 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:53,860 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:54,171 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:54,193 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:54,485 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:54,549 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:54,602 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:54,887 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:55,068 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:55,291 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:55,407 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:55,424 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:55,611 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:55,778 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:55,866 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:36:55,887 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:56,547 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:57,211 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:57,538 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:57,808 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:36:57,842 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:36:58,135 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:58,294 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:58,426 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:58,506 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:58,667 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:58,706 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:58,775 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:58,861 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:58,943 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:36:59,086 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:59,162 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:59,226 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:59,340 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:36:59,534 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:36:59,642 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:36:59,780 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:00,032 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:00,078 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:00,157 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:00,223 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:00,647 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:00,667 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:00,679 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:00,939 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:00,965 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:00,988 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:01,011 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:01,029 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:01,422 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:01,460 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:01,524 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:01,574 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:01,708 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:01,818 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:01,857 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:01,882 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:02,007 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:02,263 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:02,394 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:02,463 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:02,633 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:02,685 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:02,731 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:02,748 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:02,861 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:03,006 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:03,089 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:03,202 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:03,238 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:03,382 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:03,530 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:03,552 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:03,865 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:03,911 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:03,986 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,039 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:04,135 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:04,177 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,219 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:04,234 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,257 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,314 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,330 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:04,537 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:04,635 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:04,788 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:04,973 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:05,246 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:05,551 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:05,622 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:05,667 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:05,742 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:05,942 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:06,055 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:06,116 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:06,157 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:06,259 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:06,392 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:06,409 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:06,526 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:06,655 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:06,762 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:06,834 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:06,926 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,004 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,027 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,054 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,076 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:07,118 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,131 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,168 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,179 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:07,187 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:07,241 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,253 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,275 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,303 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:07,489 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,568 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:07,589 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,619 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:07,678 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:07,706 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:07,903 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:07,921 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:08,407 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:08,470 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:08,484 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:08,515 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:08,553 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:08,953 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,043 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,100 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:09,115 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,176 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:09,191 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,288 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,301 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:09,365 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:09,388 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,402 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:09,437 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:09,538 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:09,573 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:09,593 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:09,611 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:09,720 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:09,748 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:09,769 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:09,788 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:10,594 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:10,641 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:11,001 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:11,063 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:12,202 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:12,712 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:13,240 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:13,297 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:13,431 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:13,687 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:13,787 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:13,866 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:14,057 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:14,089 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:14,235 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:14,358 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:14,472 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:14,550 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:14,819 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:14,891 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:15,023 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:15,140 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:15,157 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:15,320 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:15,382 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:15,508 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:15,565 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:15,621 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:15,690 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:15,775 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:15,789 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:15,810 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:15,834 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:16,105 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:16,273 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:16,385 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:16,952 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:17,271 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:17,289 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:17,641 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:17,753 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:18,387 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:37:18,516 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:18,771 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:19,049 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:19,359 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:19,407 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:19,523 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:19,660 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:19,676 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:19,792 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:19,947 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:20,111 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:20,305 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:20,453 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:20,473 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:20,838 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:20,878 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:20,893 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:21,039 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:21,087 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:21,427 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:21,579 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:21,707 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:21,780 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:21,992 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:22,559 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:23,080 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:23,108 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:23,181 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:23,237 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:25,459 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:28,216 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:29,148 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:29,561 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:29,602 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:29,821 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:29,944 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:29,961 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:29,983 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:30,094 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:30,143 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:30,174 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:31,368 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:31,724 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:31,739 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:31,785 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:31,806 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:32,022 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:32,079 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:32,115 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:32,123 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:41,747 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:42,819 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:42,981 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:43,566 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:43,646 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:43,929 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:44,018 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:44,836 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:45,762 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:46,495 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:37:48,086 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:48,667 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:49,120 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:49,236 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:49,260 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:49,391 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:49,818 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:50,030 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:50,066 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:50,580 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:50,613 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:50,635 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:50,740 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:50,794 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:51,093 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:51,167 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:51,481 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:51,847 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:52,191 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:52,365 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:52,799 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:52,818 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:53,378 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:53,485 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:53,758 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:53,776 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:54,257 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:54,278 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:54,428 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:55,236 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:55,378 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:55,456 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:37:56,412 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:56,895 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:37:58,194 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:37:58,224 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:37:58,380 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:58,658 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:37:58,769 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:37:59,157 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:37:59,828 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:38:00,918 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:00,934 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:00,963 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:01,020 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:01,045 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:01,069 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:01,403 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:01,422 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:01,443 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:01,453 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:01,576 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:01,595 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:01,617 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:01,744 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:01,865 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:01,989 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:38:02,059 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:02,089 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:03,239 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:03,441 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:03,593 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:04,329 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:04,868 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:04,957 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:05,313 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:05,354 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:05,537 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:06,170 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:38:06,597 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:38:09,422 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:09,591 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:09,943 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:10,018 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:10,144 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:10,248 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:38:11,100 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:11,258 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:12,994 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:13,213 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:17,902 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:21,234 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:21,441 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:26,018 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:26,614 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:26,661 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:26,964 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:27,121 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:27,141 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:27,169 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:27,301 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:27,355 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:27,392 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:28,380 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:28,860 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:28,919 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:28,952 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:28,961 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:30,590 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:30,632 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:30,910 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:31,065 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:31,093 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:31,122 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:31,253 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:31,306 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:31,343 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:32,377 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:32,435 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:32,789 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:33,184 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:33,201 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:33,257 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:33,282 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:33,544 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:33,605 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:33,640 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:33,650 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:37,696 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:38,281 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:38,308 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:39,648 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:39,669 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:39,689 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:39,716 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:39,743 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:39,757 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:39,773 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:40,116 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:40,132 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:40,224 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:40,294 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:40,354 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:40,549 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:41,436 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:41,464 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:42,354 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:42,408 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:42,744 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:42,762 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:42,782 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:42,814 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:42,942 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:43,073 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:43,538 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:49,977 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:51,420 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:52,029 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:52,255 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:52,418 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:52,720 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:53,171 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:53,621 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:38:54,277 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:54,336 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:54,389 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:54,590 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:54,714 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:54,728 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:54,750 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:54,801 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:54,938 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:38:54,956 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:54,984 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:55,016 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:55,038 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:55,086 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:55,116 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:38:55,290 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:38:56,569 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:38:58,989 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:39:00,181 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:39:00,202 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:00,474 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:00,836 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-30 20:39:00,860 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:01,506 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:02,491 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:02,616 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:02,730 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:02,809 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:02,844 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:02,871 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:03,252 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:03,289 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:03,461 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:03,505 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:04,818 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:05,645 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:06,265 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:06,645 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:06,680 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:06,831 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:06,867 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:07,444 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:07,470 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:07,527 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:07,591 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:07,618 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:07,717 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:07,903 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:08,261 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:08,837 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:09,265 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-30 20:39:09,846 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-30 20:39:10,966 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:11,964 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:12,122 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:12,327 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:13,107 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:13,166 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:13,195 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-30 20:39:13,233 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-30 20:39:13,744 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:14,433 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:14,539 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:14,573 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:14,662 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:14,677 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:14,899 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:14,955 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-30 20:39:15,065 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:15,102 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:15,188 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-30 20:39:17,379 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:26,724 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:27,220 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-30 20:39:55,095 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-30 20:39:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025898664] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:39:55,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:39:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2023-08-30 20:39:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164977897] [2023-08-30 20:39:55,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:39:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 20:39:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:39:55,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 20:39:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1035, Unknown=27, NotChecked=134, Total=1332 [2023-08-30 20:39:55,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 353 [2023-08-30 20:39:55,243 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-30 20:39:55,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:39:55,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 353 [2023-08-30 20:39:55,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:39:59,302 INFO L130 PetriNetUnfolder]: 2209/3256 cut-off events. [2023-08-30 20:39:59,302 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2023-08-30 20:39:59,307 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-30 20:39:59,320 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 238 selfloop transitions, 101 changer transitions 9/348 dead transitions. [2023-08-30 20:39:59,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 348 transitions, 1765 flow [2023-08-30 20:39:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-30 20:39:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-30 20:39:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3296 transitions. [2023-08-30 20:39:59,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25936418004406675 [2023-08-30 20:39:59,332 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3296 transitions. [2023-08-30 20:39:59,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3296 transitions. [2023-08-30 20:39:59,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:39:59,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3296 transitions. [2023-08-30 20:39:59,341 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-30 20:39:59,356 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-30 20:39:59,358 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-30 20:39:59,358 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 119 flow. Second operand 36 states and 3296 transitions. [2023-08-30 20:39:59,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 348 transitions, 1765 flow [2023-08-30 20:39:59,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 348 transitions, 1737 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 20:39:59,367 INFO L231 Difference]: Finished difference. Result has 89 places, 131 transitions, 856 flow [2023-08-30 20:39:59,368 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-30 20:39:59,368 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2023-08-30 20:39:59,368 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 131 transitions, 856 flow [2023-08-30 20:39:59,370 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-30 20:39:59,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:39:59,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:39:59,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 20:39:59,576 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-30 20:39:59,577 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-30 20:39:59,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:39:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 550186672, now seen corresponding path program 2 times [2023-08-30 20:39:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:39:59,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770032956] [2023-08-30 20:39:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:39:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:39:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:01,123 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-30 20:40:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770032956] [2023-08-30 20:40:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770032956] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539134862] [2023-08-30 20:40:01,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:40:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:01,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:01,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:40:01,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 20:40:01,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:40:01,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:40:01,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-30 20:40:01,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:01,603 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:40:01,603 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-30 20:40:01,733 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-30 20:40:01,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:01,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:01,851 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-30 20:40:02,075 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-30 20:40:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539134862] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:02,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-08-30 20:40:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030872973] [2023-08-30 20:40:02,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:02,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 20:40:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:02,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 20:40:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2023-08-30 20:40:04,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-08-30 20:40:04,350 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-30 20:40:04,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:04,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-08-30 20:40:04,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:06,326 INFO L130 PetriNetUnfolder]: 2579/3907 cut-off events. [2023-08-30 20:40:06,326 INFO L131 PetriNetUnfolder]: For 9109/9109 co-relation queries the response was YES. [2023-08-30 20:40:06,341 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-30 20:40:06,363 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 172 selfloop transitions, 142 changer transitions 19/333 dead transitions. [2023-08-30 20:40:06,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 333 transitions, 2624 flow [2023-08-30 20:40:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 20:40:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 20:40:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2817 transitions. [2023-08-30 20:40:06,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469639118117995 [2023-08-30 20:40:06,372 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2817 transitions. [2023-08-30 20:40:06,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2817 transitions. [2023-08-30 20:40:06,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:06,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2817 transitions. [2023-08-30 20:40:06,379 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-30 20:40:06,388 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-30 20:40:06,389 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-30 20:40:06,389 INFO L175 Difference]: Start difference. First operand has 89 places, 131 transitions, 856 flow. Second operand 23 states and 2817 transitions. [2023-08-30 20:40:06,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 333 transitions, 2624 flow [2023-08-30 20:40:06,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 333 transitions, 2592 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 20:40:06,460 INFO L231 Difference]: Finished difference. Result has 120 places, 223 transitions, 2088 flow [2023-08-30 20:40:06,461 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-30 20:40:06,463 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 87 predicate places. [2023-08-30 20:40:06,463 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 223 transitions, 2088 flow [2023-08-30 20:40:06,465 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-30 20:40:06,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:06,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:06,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 20:40:06,670 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-30 20:40:06,671 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-30 20:40:06,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1216314062, now seen corresponding path program 3 times [2023-08-30 20:40:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693210087] [2023-08-30 20:40:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:07,491 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-30 20:40:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693210087] [2023-08-30 20:40:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693210087] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135413576] [2023-08-30 20:40:07,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:40:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:07,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:40:07,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 20:40:07,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 20:40:07,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:40:07,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 20:40:07,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:08,010 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:40:08,011 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-30 20:40:08,062 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-30 20:40:08,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:08,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:08,178 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-30 20:40:08,507 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-30 20:40:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135413576] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:08,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-08-30 20:40:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743085524] [2023-08-30 20:40:08,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:08,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 20:40:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:08,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 20:40:08,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-08-30 20:40:09,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 353 [2023-08-30 20:40:09,609 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-30 20:40:09,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:09,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 353 [2023-08-30 20:40:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:11,615 INFO L130 PetriNetUnfolder]: 3615/5472 cut-off events. [2023-08-30 20:40:11,615 INFO L131 PetriNetUnfolder]: For 22945/23105 co-relation queries the response was YES. [2023-08-30 20:40:11,633 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-30 20:40:11,665 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 226 selfloop transitions, 290 changer transitions 6/528 dead transitions. [2023-08-30 20:40:11,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 528 transitions, 5269 flow [2023-08-30 20:40:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 20:40:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 20:40:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4520 transitions. [2023-08-30 20:40:11,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3766038993501083 [2023-08-30 20:40:11,678 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4520 transitions. [2023-08-30 20:40:11,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4520 transitions. [2023-08-30 20:40:11,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:11,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4520 transitions. [2023-08-30 20:40:11,691 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-30 20:40:11,704 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-30 20:40:11,717 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-30 20:40:11,718 INFO L175 Difference]: Start difference. First operand has 120 places, 223 transitions, 2088 flow. Second operand 34 states and 4520 transitions. [2023-08-30 20:40:11,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 528 transitions, 5269 flow [2023-08-30 20:40:11,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 528 transitions, 5077 flow, removed 89 selfloop flow, removed 5 redundant places. [2023-08-30 20:40:11,856 INFO L231 Difference]: Finished difference. Result has 153 places, 371 transitions, 4141 flow [2023-08-30 20:40:11,856 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-30 20:40:11,857 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2023-08-30 20:40:11,857 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 371 transitions, 4141 flow [2023-08-30 20:40:11,859 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-30 20:40:11,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:11,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:11,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 20:40:12,065 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-30 20:40:12,065 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-30 20:40:12,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1145552732, now seen corresponding path program 4 times [2023-08-30 20:40:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481748815] [2023-08-30 20:40:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:13,247 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-30 20:40:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481748815] [2023-08-30 20:40:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481748815] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303973601] [2023-08-30 20:40:13,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:40:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:13,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:40:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 20:40:13,356 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:40:13,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:40:13,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-30 20:40:13,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:13,640 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:40:13,640 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-30 20:40:13,738 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-30 20:40:13,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:13,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:13,845 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-30 20:40:14,084 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-30 20:40:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303973601] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:14,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 29 [2023-08-30 20:40:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358201167] [2023-08-30 20:40:14,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 20:40:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 20:40:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2023-08-30 20:40:16,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-30 20:40:16,714 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-30 20:40:16,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:16,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-30 20:40:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:23,048 INFO L130 PetriNetUnfolder]: 6340/9484 cut-off events. [2023-08-30 20:40:23,048 INFO L131 PetriNetUnfolder]: For 51057/51057 co-relation queries the response was YES. [2023-08-30 20:40:23,074 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-30 20:40:23,114 INFO L137 encePairwiseOnDemand]: 335/353 looper letters, 465 selfloop transitions, 718 changer transitions 10/1193 dead transitions. [2023-08-30 20:40:23,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1193 transitions, 13522 flow [2023-08-30 20:40:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-30 20:40:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-30 20:40:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 9023 transitions. [2023-08-30 20:40:23,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34081208687440984 [2023-08-30 20:40:23,125 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 9023 transitions. [2023-08-30 20:40:23,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 9023 transitions. [2023-08-30 20:40:23,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:23,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 9023 transitions. [2023-08-30 20:40:23,138 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-30 20:40:23,161 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-30 20:40:23,166 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-30 20:40:23,166 INFO L175 Difference]: Start difference. First operand has 153 places, 371 transitions, 4141 flow. Second operand 75 states and 9023 transitions. [2023-08-30 20:40:23,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1193 transitions, 13522 flow [2023-08-30 20:40:23,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1193 transitions, 13069 flow, removed 105 selfloop flow, removed 11 redundant places. [2023-08-30 20:40:23,599 INFO L231 Difference]: Finished difference. Result has 236 places, 906 transitions, 11904 flow [2023-08-30 20:40:23,600 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-30 20:40:23,600 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 203 predicate places. [2023-08-30 20:40:23,600 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 906 transitions, 11904 flow [2023-08-30 20:40:23,601 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-30 20:40:23,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:23,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:23,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 20:40:23,809 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-30 20:40:23,810 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-30 20:40:23,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1850509082, now seen corresponding path program 5 times [2023-08-30 20:40:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100283187] [2023-08-30 20:40:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:25,122 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-30 20:40:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100283187] [2023-08-30 20:40:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100283187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258711453] [2023-08-30 20:40:25,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:40:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:25,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:40:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 20:40:25,234 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 20:40:25,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:40:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-30 20:40:25,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:25,523 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:40:25,524 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-30 20:40:25,638 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-30 20:40:25,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:25,805 INFO L321 Elim1Store]: treesize reduction 57, result has 26.0 percent of original size [2023-08-30 20:40:25,806 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-30 20:40:25,854 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-30 20:40:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258711453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:25,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 6] total 27 [2023-08-30 20:40:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888236500] [2023-08-30 20:40:25,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:25,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 20:40:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 20:40:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-08-30 20:40:27,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-08-30 20:40:27,905 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-30 20:40:27,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:27,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-08-30 20:40:27,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:32,902 INFO L130 PetriNetUnfolder]: 8536/13011 cut-off events. [2023-08-30 20:40:32,902 INFO L131 PetriNetUnfolder]: For 129116/129116 co-relation queries the response was YES. [2023-08-30 20:40:32,951 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-30 20:40:33,017 INFO L137 encePairwiseOnDemand]: 334/353 looper letters, 575 selfloop transitions, 1056 changer transitions 28/1659 dead transitions. [2023-08-30 20:40:33,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1659 transitions, 23226 flow [2023-08-30 20:40:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-30 20:40:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-30 20:40:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5808 transitions. [2023-08-30 20:40:33,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35006931468868663 [2023-08-30 20:40:33,027 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 5808 transitions. [2023-08-30 20:40:33,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 5808 transitions. [2023-08-30 20:40:33,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:33,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 5808 transitions. [2023-08-30 20:40:33,036 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-30 20:40:33,048 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-30 20:40:33,050 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-30 20:40:33,050 INFO L175 Difference]: Start difference. First operand has 236 places, 906 transitions, 11904 flow. Second operand 47 states and 5808 transitions. [2023-08-30 20:40:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1659 transitions, 23226 flow [2023-08-30 20:40:34,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1659 transitions, 22531 flow, removed 333 selfloop flow, removed 5 redundant places. [2023-08-30 20:40:34,065 INFO L231 Difference]: Finished difference. Result has 291 places, 1369 transitions, 20857 flow [2023-08-30 20:40:34,066 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-30 20:40:34,067 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 258 predicate places. [2023-08-30 20:40:34,067 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1369 transitions, 20857 flow [2023-08-30 20:40:34,068 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-30 20:40:34,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:34,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:34,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-30 20:40:34,273 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-30 20:40:34,274 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-30 20:40:34,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1223354686, now seen corresponding path program 6 times [2023-08-30 20:40:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389883365] [2023-08-30 20:40:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:35,349 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-30 20:40:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389883365] [2023-08-30 20:40:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389883365] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414020649] [2023-08-30 20:40:35,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:40:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:35,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:40:35,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 20:40:35,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:40:35,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:40:35,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 20:40:35,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:35,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:35,871 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-30 20:40:35,881 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-30 20:40:35,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:36,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:36,005 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-30 20:40:36,317 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-30 20:40:36,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414020649] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:36,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:36,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-08-30 20:40:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943645326] [2023-08-30 20:40:36,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:36,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 20:40:36,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:36,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 20:40:36,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2023-08-30 20:40:38,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-08-30 20:40:38,293 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-30 20:40:38,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:38,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-08-30 20:40:38,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:44,114 INFO L130 PetriNetUnfolder]: 9040/13746 cut-off events. [2023-08-30 20:40:44,114 INFO L131 PetriNetUnfolder]: For 172332/172332 co-relation queries the response was YES. [2023-08-30 20:40:44,196 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-30 20:40:44,273 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 721 selfloop transitions, 1039 changer transitions 9/1769 dead transitions. [2023-08-30 20:40:44,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1769 transitions, 28978 flow [2023-08-30 20:40:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-30 20:40:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-30 20:40:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 4639 transitions. [2023-08-30 20:40:44,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3369652066535919 [2023-08-30 20:40:44,280 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 4639 transitions. [2023-08-30 20:40:44,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 4639 transitions. [2023-08-30 20:40:44,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:44,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 4639 transitions. [2023-08-30 20:40:44,290 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-30 20:40:44,303 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-30 20:40:44,306 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-30 20:40:44,306 INFO L175 Difference]: Start difference. First operand has 291 places, 1369 transitions, 20857 flow. Second operand 39 states and 4639 transitions. [2023-08-30 20:40:44,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1769 transitions, 28978 flow [2023-08-30 20:40:46,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1769 transitions, 27729 flow, removed 453 selfloop flow, removed 9 redundant places. [2023-08-30 20:40:46,792 INFO L231 Difference]: Finished difference. Result has 327 places, 1565 transitions, 26198 flow [2023-08-30 20:40:46,793 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-30 20:40:46,794 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 294 predicate places. [2023-08-30 20:40:46,794 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 1565 transitions, 26198 flow [2023-08-30 20:40:46,795 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-30 20:40:46,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:46,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:46,799 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-30 20:40:46,995 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-30 20:40:46,996 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-30 20:40:46,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1789474852, now seen corresponding path program 7 times [2023-08-30 20:40:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078323789] [2023-08-30 20:40:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:47,696 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-30 20:40:47,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:40:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078323789] [2023-08-30 20:40:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078323789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:40:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965972322] [2023-08-30 20:40:47,697 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:40:47,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:40:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:40:47,701 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-30 20:40:47,726 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-30 20:40:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:40:47,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-30 20:40:47,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:40:48,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:40:48,161 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-30 20:40:48,162 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-30 20:40:48,192 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-30 20:40:48,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:40:48,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:40:48,263 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-30 20:40:48,516 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-30 20:40:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965972322] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:40:48,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:40:48,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2023-08-30 20:40:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415143423] [2023-08-30 20:40:48,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:40:48,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 20:40:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:40:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 20:40:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-08-30 20:40:49,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 353 [2023-08-30 20:40:49,777 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-30 20:40:49,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:40:49,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 353 [2023-08-30 20:40:49,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:40:55,525 INFO L130 PetriNetUnfolder]: 10804/16522 cut-off events. [2023-08-30 20:40:55,525 INFO L131 PetriNetUnfolder]: For 213024/213143 co-relation queries the response was YES. [2023-08-30 20:40:55,620 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-30 20:40:55,686 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 993 selfloop transitions, 1210 changer transitions 5/2235 dead transitions. [2023-08-30 20:40:55,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 2235 transitions, 39982 flow [2023-08-30 20:40:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 20:40:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 20:40:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4460 transitions. [2023-08-30 20:40:55,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3716047325445759 [2023-08-30 20:40:55,691 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4460 transitions. [2023-08-30 20:40:55,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4460 transitions. [2023-08-30 20:40:55,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:40:55,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4460 transitions. [2023-08-30 20:40:55,698 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-30 20:40:55,705 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-30 20:40:55,707 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-30 20:40:55,708 INFO L175 Difference]: Start difference. First operand has 327 places, 1565 transitions, 26198 flow. Second operand 34 states and 4460 transitions. [2023-08-30 20:40:55,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 2235 transitions, 39982 flow [2023-08-30 20:40:59,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 2235 transitions, 39299 flow, removed 89 selfloop flow, removed 15 redundant places. [2023-08-30 20:40:59,362 INFO L231 Difference]: Finished difference. Result has 358 places, 1960 transitions, 37270 flow [2023-08-30 20:40:59,364 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-30 20:40:59,364 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 325 predicate places. [2023-08-30 20:40:59,364 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1960 transitions, 37270 flow [2023-08-30 20:40:59,365 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-30 20:40:59,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:40:59,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:40:59,370 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-30 20:40:59,566 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-30 20:40:59,566 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-30 20:40:59,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:40:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1064531612, now seen corresponding path program 8 times [2023-08-30 20:40:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:40:59,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145969531] [2023-08-30 20:40:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:40:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:40:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:41:00,590 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-30 20:41:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:41:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145969531] [2023-08-30 20:41:00,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145969531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:41:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691593551] [2023-08-30 20:41:00,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:41:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:41:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:41:00,592 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-30 20:41:00,593 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-30 20:41:00,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:41:00,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:41:00,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-30 20:41:00,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:41:01,199 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:41:01,199 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-30 20:41:01,249 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-30 20:41:01,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:41:01,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:41:01,385 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-30 20:41:01,671 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-30 20:41:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691593551] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:41:01,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:41:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 33 [2023-08-30 20:41:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899133396] [2023-08-30 20:41:01,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:41:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 20:41:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:41:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 20:41:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2023-08-30 20:41:04,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-08-30 20:41:04,366 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-30 20:41:04,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:41:04,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-08-30 20:41:04,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:41:17,763 INFO L130 PetriNetUnfolder]: 14020/21192 cut-off events. [2023-08-30 20:41:17,764 INFO L131 PetriNetUnfolder]: For 329859/329859 co-relation queries the response was YES. [2023-08-30 20:41:17,904 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-30 20:41:17,993 INFO L137 encePairwiseOnDemand]: 336/353 looper letters, 720 selfloop transitions, 2274 changer transitions 6/3000 dead transitions. [2023-08-30 20:41:17,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 3000 transitions, 58069 flow [2023-08-30 20:41:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-08-30 20:41:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-08-30 20:41:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 11031 transitions. [2023-08-30 20:41:18,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3360138901580919 [2023-08-30 20:41:18,006 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 11031 transitions. [2023-08-30 20:41:18,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 11031 transitions. [2023-08-30 20:41:18,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:41:18,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 11031 transitions. [2023-08-30 20:41:18,022 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-30 20:41:18,044 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-30 20:41:18,050 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-30 20:41:18,050 INFO L175 Difference]: Start difference. First operand has 358 places, 1960 transitions, 37270 flow. Second operand 93 states and 11031 transitions. [2023-08-30 20:41:18,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 3000 transitions, 58069 flow [2023-08-30 20:41:25,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 3000 transitions, 57792 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-30 20:41:25,417 INFO L231 Difference]: Finished difference. Result has 460 places, 2713 transitions, 57124 flow [2023-08-30 20:41:25,419 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-30 20:41:25,419 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 427 predicate places. [2023-08-30 20:41:25,420 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 2713 transitions, 57124 flow [2023-08-30 20:41:25,420 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-30 20:41:25,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:41:25,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:41:25,429 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-30 20:41:25,627 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-30 20:41:25,627 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-30 20:41:25,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:41:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 228834432, now seen corresponding path program 9 times [2023-08-30 20:41:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:41:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091436720] [2023-08-30 20:41:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:41:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:41:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:41:26,614 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-30 20:41:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:41:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091436720] [2023-08-30 20:41:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091436720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:41:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509508841] [2023-08-30 20:41:26,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:41:26,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:41:26,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:41:26,616 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-30 20:41:26,618 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-30 20:41:26,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:41:26,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:41:26,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-30 20:41:26,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:41:27,002 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:41:27,002 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-30 20:41:27,065 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-30 20:41:27,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:41:27,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:41:27,173 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-30 20:41:27,392 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-30 20:41:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509508841] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:41:27,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:41:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-08-30 20:41:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64242175] [2023-08-30 20:41:27,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:41:27,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 20:41:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:41:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 20:41:27,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2023-08-30 20:41:29,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-08-30 20:41:29,170 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-30 20:41:29,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:41:29,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-08-30 20:41:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:41:38,941 INFO L130 PetriNetUnfolder]: 14135/21419 cut-off events. [2023-08-30 20:41:38,941 INFO L131 PetriNetUnfolder]: For 404146/404146 co-relation queries the response was YES. [2023-08-30 20:41:39,145 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-30 20:41:39,262 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 1612 selfloop transitions, 1171 changer transitions 13/2796 dead transitions. [2023-08-30 20:41:39,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 2796 transitions, 63522 flow [2023-08-30 20:41:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 20:41:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 20:41:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1968 transitions. [2023-08-30 20:41:39,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34844192634560905 [2023-08-30 20:41:39,266 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1968 transitions. [2023-08-30 20:41:39,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1968 transitions. [2023-08-30 20:41:39,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:41:39,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1968 transitions. [2023-08-30 20:41:39,269 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-30 20:41:39,273 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-30 20:41:39,274 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-30 20:41:39,274 INFO L175 Difference]: Start difference. First operand has 460 places, 2713 transitions, 57124 flow. Second operand 16 states and 1968 transitions. [2023-08-30 20:41:39,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 2796 transitions, 63522 flow [2023-08-30 20:41:49,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2796 transitions, 62301 flow, removed 576 selfloop flow, removed 9 redundant places. [2023-08-30 20:41:49,685 INFO L231 Difference]: Finished difference. Result has 472 places, 2734 transitions, 60370 flow [2023-08-30 20:41:49,687 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-30 20:41:49,689 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 439 predicate places. [2023-08-30 20:41:49,690 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 2734 transitions, 60370 flow [2023-08-30 20:41:49,690 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-30 20:41:49,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:41:49,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:41:49,697 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-30 20:41:49,896 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-30 20:41:49,896 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-30 20:41:49,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:41:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -475621398, now seen corresponding path program 10 times [2023-08-30 20:41:49,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:41:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600609914] [2023-08-30 20:41:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:41:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:41:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:41:50,852 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-30 20:41:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:41:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600609914] [2023-08-30 20:41:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600609914] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:41:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536542316] [2023-08-30 20:41:50,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:41:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:41:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:41:50,854 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-30 20:41:50,856 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-30 20:41:50,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:41:50,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:41:50,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-30 20:41:50,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:41:51,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:41:51,322 INFO L321 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-08-30 20:41:51,323 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-30 20:41:51,332 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-30 20:41:51,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:41:51,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:41:51,467 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-30 20:41:51,767 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-30 20:41:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536542316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:41:51,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:41:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2023-08-30 20:41:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015020689] [2023-08-30 20:41:51,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:41:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 20:41:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:41:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 20:41:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2023-08-30 20:41:53,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 353 [2023-08-30 20:41:53,492 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-30 20:41:53,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:41:53,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 353 [2023-08-30 20:41:53,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:42:04,209 INFO L130 PetriNetUnfolder]: 14151/21465 cut-off events. [2023-08-30 20:42:04,209 INFO L131 PetriNetUnfolder]: For 471086/471086 co-relation queries the response was YES. [2023-08-30 20:42:04,465 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-30 20:42:04,567 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1529 selfloop transitions, 1265 changer transitions 6/2800 dead transitions. [2023-08-30 20:42:04,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 2800 transitions, 66594 flow [2023-08-30 20:42:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 20:42:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 20:42:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2342 transitions. [2023-08-30 20:42:04,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33172804532577904 [2023-08-30 20:42:04,569 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2342 transitions. [2023-08-30 20:42:04,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2342 transitions. [2023-08-30 20:42:04,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:42:04,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2342 transitions. [2023-08-30 20:42:04,572 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-30 20:42:04,577 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-30 20:42:04,578 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-30 20:42:04,578 INFO L175 Difference]: Start difference. First operand has 472 places, 2734 transitions, 60370 flow. Second operand 20 states and 2342 transitions. [2023-08-30 20:42:04,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 2800 transitions, 66594 flow [2023-08-30 20:42:15,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 2800 transitions, 65912 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-30 20:42:15,141 INFO L231 Difference]: Finished difference. Result has 490 places, 2750 transitions, 63688 flow [2023-08-30 20:42:15,143 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-30 20:42:15,144 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 457 predicate places. [2023-08-30 20:42:15,144 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 2750 transitions, 63688 flow [2023-08-30 20:42:15,145 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-30 20:42:15,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:42:15,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:42:15,149 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-30 20:42:15,345 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-30 20:42:15,346 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-30 20:42:15,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:42:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1967116930, now seen corresponding path program 11 times [2023-08-30 20:42:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:42:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458004217] [2023-08-30 20:42:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:42:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:42:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:42:16,383 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-30 20:42:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:42:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458004217] [2023-08-30 20:42:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458004217] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:42:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855758772] [2023-08-30 20:42:16,383 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:42:16,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:42:16,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:42:16,384 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-30 20:42:16,386 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-30 20:42:16,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:42:16,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:42:16,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 20:42:16,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:42:16,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:42:16,889 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-30 20:42:16,899 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-30 20:42:16,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:42:17,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:42:17,056 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-30 20:42:17,273 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-30 20:42:17,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855758772] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:42:17,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:42:17,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-08-30 20:42:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475339168] [2023-08-30 20:42:17,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:42:17,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 20:42:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:42:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 20:42:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-08-30 20:42:19,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-30 20:42:19,891 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-30 20:42:19,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:42:19,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-30 20:42:19,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:42:32,368 INFO L130 PetriNetUnfolder]: 12473/19216 cut-off events. [2023-08-30 20:42:32,368 INFO L131 PetriNetUnfolder]: For 473242/473242 co-relation queries the response was YES. [2023-08-30 20:42:32,524 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-30 20:42:32,613 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 830 selfloop transitions, 1712 changer transitions 9/2551 dead transitions. [2023-08-30 20:42:32,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 2551 transitions, 63082 flow [2023-08-30 20:42:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-30 20:42:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-30 20:42:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 5943 transitions. [2023-08-30 20:42:32,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33671388101983 [2023-08-30 20:42:32,620 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 5943 transitions. [2023-08-30 20:42:32,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 5943 transitions. [2023-08-30 20:42:32,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:42:32,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 5943 transitions. [2023-08-30 20:42:32,628 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-30 20:42:32,638 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-30 20:42:32,640 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-30 20:42:32,640 INFO L175 Difference]: Start difference. First operand has 490 places, 2750 transitions, 63688 flow. Second operand 50 states and 5943 transitions. [2023-08-30 20:42:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 2551 transitions, 63082 flow [2023-08-30 20:42:40,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2551 transitions, 61834 flow, removed 103 selfloop flow, removed 21 redundant places. [2023-08-30 20:42:40,791 INFO L231 Difference]: Finished difference. Result has 509 places, 2401 transitions, 62267 flow [2023-08-30 20:42:40,793 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-30 20:42:40,793 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 476 predicate places. [2023-08-30 20:42:40,793 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 2401 transitions, 62267 flow [2023-08-30 20:42:40,794 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-30 20:42:40,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:42:40,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:42:40,800 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-30 20:42:40,995 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-30 20:42:40,995 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-30 20:42:40,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:42:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -625829824, now seen corresponding path program 12 times [2023-08-30 20:42:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:42:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109734765] [2023-08-30 20:42:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:42:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:42:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:42:41,807 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-30 20:42:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:42:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109734765] [2023-08-30 20:42:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109734765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:42:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783487539] [2023-08-30 20:42:41,807 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:42:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:42:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:42:41,809 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-30 20:42:41,813 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-30 20:42:41,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:42:41,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:42:41,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-30 20:42:41,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:42:42,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:42:42,223 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-30 20:42:42,242 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-30 20:42:42,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:42:42,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:42:42,370 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-30 20:42:42,618 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-30 20:42:42,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783487539] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:42:42,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:42:42,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 31 [2023-08-30 20:42:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586287253] [2023-08-30 20:42:42,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:42:42,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 20:42:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:42:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 20:42:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2023-08-30 20:42:44,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-08-30 20:42:44,079 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-30 20:42:44,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:42:44,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-08-30 20:42:44,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:42:54,125 INFO L130 PetriNetUnfolder]: 12557/19374 cut-off events. [2023-08-30 20:42:54,125 INFO L131 PetriNetUnfolder]: For 550924/550924 co-relation queries the response was YES. [2023-08-30 20:42:54,413 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-30 20:42:54,500 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1287 selfloop transitions, 1212 changer transitions 6/2505 dead transitions. [2023-08-30 20:42:54,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 2505 transitions, 69142 flow [2023-08-30 20:42:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 20:42:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 20:42:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2383 transitions. [2023-08-30 20:42:54,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33753541076487253 [2023-08-30 20:42:54,503 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2383 transitions. [2023-08-30 20:42:54,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2383 transitions. [2023-08-30 20:42:54,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:42:54,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2383 transitions. [2023-08-30 20:42:54,506 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-30 20:42:54,510 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-30 20:42:54,510 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-30 20:42:54,510 INFO L175 Difference]: Start difference. First operand has 509 places, 2401 transitions, 62267 flow. Second operand 20 states and 2383 transitions. [2023-08-30 20:42:54,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 2505 transitions, 69142 flow [2023-08-30 20:43:04,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 2505 transitions, 68696 flow, removed 168 selfloop flow, removed 11 redundant places. [2023-08-30 20:43:04,132 INFO L231 Difference]: Finished difference. Result has 522 places, 2454 transitions, 66979 flow [2023-08-30 20:43:04,134 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-30 20:43:04,134 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 489 predicate places. [2023-08-30 20:43:04,134 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 2454 transitions, 66979 flow [2023-08-30 20:43:04,135 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-30 20:43:04,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:43:04,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:43:04,140 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-30 20:43:04,335 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-30 20:43:04,336 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-30 20:43:04,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:43:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1375121970, now seen corresponding path program 13 times [2023-08-30 20:43:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:43:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758836383] [2023-08-30 20:43:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:43:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:43:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:43:05,330 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-30 20:43:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:43:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758836383] [2023-08-30 20:43:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758836383] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:43:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152160781] [2023-08-30 20:43:05,330 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:43:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:43:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:43:05,332 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-30 20:43:05,333 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-30 20:43:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:43:05,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-30 20:43:05,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:43:05,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:43:05,736 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-30 20:43:05,744 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-30 20:43:05,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:43:05,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:43:05,830 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-30 20:43:06,124 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-30 20:43:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152160781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:43:06,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:43:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2023-08-30 20:43:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710455190] [2023-08-30 20:43:06,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:43:06,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 20:43:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:43:06,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 20:43:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2023-08-30 20:43:07,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-08-30 20:43:07,683 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-30 20:43:07,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:43:07,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-08-30 20:43:07,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:43:19,463 INFO L130 PetriNetUnfolder]: 13523/20972 cut-off events. [2023-08-30 20:43:19,463 INFO L131 PetriNetUnfolder]: For 721329/721508 co-relation queries the response was YES. [2023-08-30 20:43:19,864 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-30 20:43:19,969 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1653 selfloop transitions, 1149 changer transitions 1/2835 dead transitions. [2023-08-30 20:43:19,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2835 transitions, 80586 flow [2023-08-30 20:43:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 20:43:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 20:43:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3684 transitions. [2023-08-30 20:43:19,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34787535410764875 [2023-08-30 20:43:19,974 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3684 transitions. [2023-08-30 20:43:19,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3684 transitions. [2023-08-30 20:43:19,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:43:19,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3684 transitions. [2023-08-30 20:43:19,979 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-30 20:43:19,986 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-30 20:43:19,987 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-30 20:43:19,987 INFO L175 Difference]: Start difference. First operand has 522 places, 2454 transitions, 66979 flow. Second operand 30 states and 3684 transitions. [2023-08-30 20:43:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 2835 transitions, 80586 flow [2023-08-30 20:43:30,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 2835 transitions, 79801 flow, removed 28 selfloop flow, removed 12 redundant places. [2023-08-30 20:43:30,658 INFO L231 Difference]: Finished difference. Result has 544 places, 2668 transitions, 75354 flow [2023-08-30 20:43:30,660 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-30 20:43:30,661 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-30 20:43:30,661 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 2668 transitions, 75354 flow [2023-08-30 20:43:30,662 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-30 20:43:30,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:43:30,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:43:30,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 20:43:30,867 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-30 20:43:30,868 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-30 20:43:30,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:43:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1253047374, now seen corresponding path program 14 times [2023-08-30 20:43:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:43:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556291316] [2023-08-30 20:43:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:43:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:43:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:43:31,428 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-30 20:43:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:43:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556291316] [2023-08-30 20:43:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556291316] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:43:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698202290] [2023-08-30 20:43:31,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:43:31,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:43:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:43:31,429 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-30 20:43:31,431 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-30 20:43:31,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:43:31,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:43:31,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 20:43:31,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:43:31,820 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-08-30 20:43:31,820 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-30 20:43:31,900 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-30 20:43:31,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:43:32,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:43:32,008 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-30 20:43:32,180 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-30 20:43:32,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698202290] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:43:32,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:43:32,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-08-30 20:43:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575435390] [2023-08-30 20:43:32,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:43:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 20:43:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:43:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 20:43:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-08-30 20:43:33,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 353 [2023-08-30 20:43:33,291 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-30 20:43:33,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:43:33,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 353 [2023-08-30 20:43:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:43:45,836 INFO L130 PetriNetUnfolder]: 14315/22175 cut-off events. [2023-08-30 20:43:45,837 INFO L131 PetriNetUnfolder]: For 760067/760251 co-relation queries the response was YES. [2023-08-30 20:43:46,351 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-30 20:43:46,468 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1101 selfloop transitions, 1751 changer transitions 6/2890 dead transitions. [2023-08-30 20:43:46,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2890 transitions, 84916 flow [2023-08-30 20:43:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 20:43:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 20:43:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3371 transitions. [2023-08-30 20:43:46,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36729134887775117 [2023-08-30 20:43:46,471 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3371 transitions. [2023-08-30 20:43:46,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3371 transitions. [2023-08-30 20:43:46,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:43:46,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3371 transitions. [2023-08-30 20:43:46,474 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-30 20:43:46,480 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-30 20:43:46,481 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-30 20:43:46,481 INFO L175 Difference]: Start difference. First operand has 544 places, 2668 transitions, 75354 flow. Second operand 26 states and 3371 transitions. [2023-08-30 20:43:46,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 2890 transitions, 84916 flow [2023-08-30 20:43:58,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 2890 transitions, 84753 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-08-30 20:43:58,684 INFO L231 Difference]: Finished difference. Result has 567 places, 2767 transitions, 82041 flow [2023-08-30 20:43:58,686 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-30 20:43:58,686 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 534 predicate places. [2023-08-30 20:43:58,686 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 2767 transitions, 82041 flow [2023-08-30 20:43:58,687 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-30 20:43:58,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:43:58,687 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-30 20:43:58,695 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-30 20:43:58,893 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-30 20:43:58,894 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-30 20:43:58,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:43:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1650705045, now seen corresponding path program 15 times [2023-08-30 20:43:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:43:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929818684] [2023-08-30 20:43:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:43:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:43:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:43:58,987 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-30 20:43:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:43:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929818684] [2023-08-30 20:43:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929818684] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:43:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615050880] [2023-08-30 20:43:58,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:43:58,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:43:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:43:58,989 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-30 20:43:58,992 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-30 20:43:59,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:43:59,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:43:59,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:43:59,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:43:59,194 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-30 20:43:59,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:43:59,238 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-30 20:43:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615050880] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:43:59,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:43:59,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-30 20:43:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052709099] [2023-08-30 20:43:59,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:43:59,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 20:43:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:43:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 20:43:59,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-08-30 20:43:59,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-30 20:43:59,434 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-30 20:43:59,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:43:59,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-30 20:43:59,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:44:12,706 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-30 20:44:12,707 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 20:44:12,707 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 20:44:12,707 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 20:44:12,707 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 20:44:14,780 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-30 20:44:14,780 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 20:44:14,780 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 20:44:14,781 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 20:44:14,781 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 20:44:18,546 INFO L130 PetriNetUnfolder]: 20257/32768 cut-off events. [2023-08-30 20:44:18,546 INFO L131 PetriNetUnfolder]: For 1480218/1481229 co-relation queries the response was YES. [2023-08-30 20:44:19,546 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-30 20:44:19,836 INFO L137 encePairwiseOnDemand]: 345/353 looper letters, 3012 selfloop transitions, 546 changer transitions 68/3702 dead transitions. [2023-08-30 20:44:19,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 3702 transitions, 119734 flow [2023-08-30 20:44:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 20:44:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 20:44:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1864 transitions. [2023-08-30 20:44:19,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4400377714825307 [2023-08-30 20:44:19,838 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1864 transitions. [2023-08-30 20:44:19,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1864 transitions. [2023-08-30 20:44:19,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:44:19,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1864 transitions. [2023-08-30 20:44:19,839 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-30 20:44:19,842 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-30 20:44:19,842 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-30 20:44:19,842 INFO L175 Difference]: Start difference. First operand has 567 places, 2767 transitions, 82041 flow. Second operand 12 states and 1864 transitions. [2023-08-30 20:44:19,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 3702 transitions, 119734 flow [2023-08-30 20:44:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 3702 transitions, 118377 flow, removed 159 selfloop flow, removed 18 redundant places. [2023-08-30 20:44:45,700 INFO L231 Difference]: Finished difference. Result has 557 places, 2481 transitions, 76277 flow [2023-08-30 20:44:45,703 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-30 20:44:45,703 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 524 predicate places. [2023-08-30 20:44:45,703 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 2481 transitions, 76277 flow [2023-08-30 20:44:45,704 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-30 20:44:45,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:44:45,704 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-30 20:44:45,715 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-30 20:44:45,910 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-30 20:44:45,911 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-30 20:44:45,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:44:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash 823383047, now seen corresponding path program 16 times [2023-08-30 20:44:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:44:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414953906] [2023-08-30 20:44:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:44:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:44:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:44:46,018 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-30 20:44:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:44:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414953906] [2023-08-30 20:44:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414953906] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:44:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181629757] [2023-08-30 20:44:46,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:44:46,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:44:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:44:46,029 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-30 20:44:46,033 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-30 20:44:46,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:44:46,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:44:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 20:44:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:44:46,225 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-30 20:44:46,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:44:46,308 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-30 20:44:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181629757] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:44:46,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:44:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-08-30 20:44:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748934839] [2023-08-30 20:44:46,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:44:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 20:44:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:44:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 20:44:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-30 20:44:46,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-30 20:44:46,715 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-30 20:44:46,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:44:46,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-30 20:44:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:45:08,089 INFO L130 PetriNetUnfolder]: 24038/38189 cut-off events. [2023-08-30 20:45:08,089 INFO L131 PetriNetUnfolder]: For 1552510/1552650 co-relation queries the response was YES. [2023-08-30 20:45:09,254 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-30 20:45:09,445 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1488 selfloop transitions, 2652 changer transitions 9/4248 dead transitions. [2023-08-30 20:45:09,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 4248 transitions, 131236 flow [2023-08-30 20:45:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 20:45:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 20:45:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4708 transitions. [2023-08-30 20:45:09,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41678470254957506 [2023-08-30 20:45:09,447 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4708 transitions. [2023-08-30 20:45:09,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4708 transitions. [2023-08-30 20:45:09,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:45:09,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4708 transitions. [2023-08-30 20:45:09,451 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-30 20:45:09,455 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-30 20:45:09,455 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-30 20:45:09,455 INFO L175 Difference]: Start difference. First operand has 557 places, 2481 transitions, 76277 flow. Second operand 32 states and 4708 transitions. [2023-08-30 20:45:09,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 4248 transitions, 131236 flow [2023-08-30 20:45:36,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 4248 transitions, 127925 flow, removed 595 selfloop flow, removed 36 redundant places. [2023-08-30 20:45:36,949 INFO L231 Difference]: Finished difference. Result has 544 places, 3644 transitions, 118305 flow [2023-08-30 20:45:36,951 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-30 20:45:36,951 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-30 20:45:36,951 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 3644 transitions, 118305 flow [2023-08-30 20:45:36,952 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-30 20:45:36,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:45:36,952 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-30 20:45:36,957 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-30 20:45:37,152 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-30 20:45:37,153 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-30 20:45:37,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:45:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash 358970001, now seen corresponding path program 1 times [2023-08-30 20:45:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:45:37,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584457228] [2023-08-30 20:45:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:45:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:45:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:45:37,257 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-30 20:45:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:45:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584457228] [2023-08-30 20:45:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584457228] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:45:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421905560] [2023-08-30 20:45:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:45:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:45:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:45:37,259 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-30 20:45:37,260 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-30 20:45:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:45:37,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 20:45:37,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:45:37,441 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-30 20:45:37,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:45:37,490 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-30 20:45:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421905560] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:45:37,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:45:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-08-30 20:45:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935919982] [2023-08-30 20:45:37,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:45:37,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 20:45:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:45:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 20:45:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-08-30 20:45:37,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-30 20:45:37,830 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-30 20:45:37,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:45:37,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-30 20:45:37,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:46:12,824 INFO L130 PetriNetUnfolder]: 27149/43154 cut-off events. [2023-08-30 20:46:12,825 INFO L131 PetriNetUnfolder]: For 2086351/2086517 co-relation queries the response was YES. [2023-08-30 20:46:14,200 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-30 20:46:14,555 INFO L137 encePairwiseOnDemand]: 343/353 looper letters, 3689 selfloop transitions, 1164 changer transitions 82/5034 dead transitions. [2023-08-30 20:46:14,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 5034 transitions, 167769 flow [2023-08-30 20:46:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 20:46:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 20:46:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3854 transitions. [2023-08-30 20:46:14,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41991719328829813 [2023-08-30 20:46:14,559 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3854 transitions. [2023-08-30 20:46:14,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3854 transitions. [2023-08-30 20:46:14,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:46:14,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3854 transitions. [2023-08-30 20:46:14,563 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-30 20:46:14,567 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-30 20:46:14,568 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-30 20:46:14,568 INFO L175 Difference]: Start difference. First operand has 544 places, 3644 transitions, 118305 flow. Second operand 26 states and 3854 transitions. [2023-08-30 20:46:14,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 5034 transitions, 167769 flow [2023-08-30 20:46:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 5034 transitions, 166844 flow, removed 458 selfloop flow, removed 4 redundant places. [2023-08-30 20:46:58,941 INFO L231 Difference]: Finished difference. Result has 579 places, 4094 transitions, 134332 flow [2023-08-30 20:46:58,944 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-30 20:46:58,944 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 546 predicate places. [2023-08-30 20:46:58,944 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 4094 transitions, 134332 flow [2023-08-30 20:46:58,944 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-30 20:46:58,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:46:58,945 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-30 20:46:58,950 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-30 20:46:59,145 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-30 20:46:59,145 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-30 20:46:59,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:46:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash 978819407, now seen corresponding path program 17 times [2023-08-30 20:46:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:46:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219968451] [2023-08-30 20:46:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:46:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:46:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:46:59,246 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-30 20:46:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:46:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219968451] [2023-08-30 20:46:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219968451] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:46:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428443997] [2023-08-30 20:46:59,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:46:59,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:46:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:46:59,248 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-30 20:46:59,250 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-30 20:46:59,369 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:46:59,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:46:59,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:46:59,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:46:59,433 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-30 20:46:59,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:46:59,482 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-30 20:46:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428443997] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:46:59,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:46:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-08-30 20:46:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665807497] [2023-08-30 20:46:59,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:46:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 20:46:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:46:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 20:46:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-30 20:46:59,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-08-30 20:46:59,713 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-30 20:46:59,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:46:59,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-08-30 20:46:59,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:47:24,392 INFO L130 PetriNetUnfolder]: 16856/26602 cut-off events. [2023-08-30 20:47:24,393 INFO L131 PetriNetUnfolder]: For 1306540/1306992 co-relation queries the response was YES. [2023-08-30 20:47:25,057 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-30 20:47:25,183 INFO L137 encePairwiseOnDemand]: 346/353 looper letters, 2255 selfloop transitions, 230 changer transitions 1099/3645 dead transitions. [2023-08-30 20:47:25,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 3645 transitions, 122238 flow [2023-08-30 20:47:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:47:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:47:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2023-08-30 20:47:25,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43590651558073656 [2023-08-30 20:47:25,184 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1231 transitions. [2023-08-30 20:47:25,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1231 transitions. [2023-08-30 20:47:25,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:47:25,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1231 transitions. [2023-08-30 20:47:25,186 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-30 20:47:25,187 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-30 20:47:25,188 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-30 20:47:25,188 INFO L175 Difference]: Start difference. First operand has 579 places, 4094 transitions, 134332 flow. Second operand 8 states and 1231 transitions. [2023-08-30 20:47:25,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 3645 transitions, 122238 flow [2023-08-30 20:47:44,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 3645 transitions, 119491 flow, removed 478 selfloop flow, removed 15 redundant places. [2023-08-30 20:47:44,707 INFO L231 Difference]: Finished difference. Result has 568 places, 2332 transitions, 71897 flow [2023-08-30 20:47:44,709 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-30 20:47:44,709 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 535 predicate places. [2023-08-30 20:47:44,709 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 2332 transitions, 71897 flow [2023-08-30 20:47:44,710 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-30 20:47:44,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:47:44,710 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-30 20:47:44,715 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-30 20:47:44,910 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-30 20:47:44,911 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-30 20:47:44,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:47:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1527957887, now seen corresponding path program 2 times [2023-08-30 20:47:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:47:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125636974] [2023-08-30 20:47:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:47:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:47:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:47:45,003 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-30 20:47:45,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:47:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125636974] [2023-08-30 20:47:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125636974] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:47:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740668027] [2023-08-30 20:47:45,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:47:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:47:45,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:47:45,009 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-30 20:47:45,013 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-30 20:47:45,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:47:45,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:47:45,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 20:47:45,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:47:45,253 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-30 20:47:45,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:47:45,323 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-30 20:47:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740668027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:47:45,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:47:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-08-30 20:47:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048235298] [2023-08-30 20:47:45,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:47:45,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 20:47:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:47:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 20:47:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-08-30 20:47:45,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-30 20:47:45,659 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-30 20:47:45,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:47:45,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-30 20:47:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:48:01,169 INFO L130 PetriNetUnfolder]: 17629/28087 cut-off events. [2023-08-30 20:48:01,169 INFO L131 PetriNetUnfolder]: For 1405878/1406052 co-relation queries the response was YES. [2023-08-30 20:48:02,008 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-30 20:48:02,151 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 2658 selfloop transitions, 483 changer transitions 49/3253 dead transitions. [2023-08-30 20:48:02,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 3253 transitions, 103279 flow [2023-08-30 20:48:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 20:48:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 20:48:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3097 transitions. [2023-08-30 20:48:02,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41777957641980307 [2023-08-30 20:48:02,154 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3097 transitions. [2023-08-30 20:48:02,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3097 transitions. [2023-08-30 20:48:02,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:48:02,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3097 transitions. [2023-08-30 20:48:02,156 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-30 20:48:02,159 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-30 20:48:02,159 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-30 20:48:02,159 INFO L175 Difference]: Start difference. First operand has 568 places, 2332 transitions, 71897 flow. Second operand 21 states and 3097 transitions. [2023-08-30 20:48:02,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 3253 transitions, 103279 flow [2023-08-30 20:48:17,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 3253 transitions, 100197 flow, removed 356 selfloop flow, removed 23 redundant places. [2023-08-30 20:48:17,936 INFO L231 Difference]: Finished difference. Result has 556 places, 2550 transitions, 77485 flow [2023-08-30 20:48:17,937 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-30 20:48:17,938 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 523 predicate places. [2023-08-30 20:48:17,938 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 2550 transitions, 77485 flow [2023-08-30 20:48:17,938 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-30 20:48:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:48:17,938 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-30 20:48:17,943 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-30 20:48:18,138 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-30 20:48:18,139 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-30 20:48:18,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:48:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -485434675, now seen corresponding path program 18 times [2023-08-30 20:48:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:48:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437045548] [2023-08-30 20:48:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:48:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:48:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:48:18,257 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-30 20:48:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:48:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437045548] [2023-08-30 20:48:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437045548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:48:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676444846] [2023-08-30 20:48:18,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:48:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:48:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:48:18,261 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-30 20:48:18,291 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-30 20:48:18,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 20:48:18,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:48:18,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 20:48:18,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:48:18,635 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-30 20:48:18,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:48:18,687 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-30 20:48:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676444846] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:48:18,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:48:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-08-30 20:48:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26048721] [2023-08-30 20:48:18,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:48:18,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 20:48:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:48:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 20:48:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-08-30 20:48:18,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 353 [2023-08-30 20:48:18,938 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-30 20:48:18,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:48:18,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 353 [2023-08-30 20:48:18,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:48:30,452 INFO L130 PetriNetUnfolder]: 11887/19805 cut-off events. [2023-08-30 20:48:30,452 INFO L131 PetriNetUnfolder]: For 928771/929124 co-relation queries the response was YES. [2023-08-30 20:48:30,747 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-30 20:48:30,837 INFO L137 encePairwiseOnDemand]: 344/353 looper letters, 1654 selfloop transitions, 167 changer transitions 179/2081 dead transitions. [2023-08-30 20:48:30,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 2081 transitions, 62266 flow [2023-08-30 20:48:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 20:48:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 20:48:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1505 transitions. [2023-08-30 20:48:30,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263456090651558 [2023-08-30 20:48:30,838 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1505 transitions. [2023-08-30 20:48:30,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1505 transitions. [2023-08-30 20:48:30,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:48:30,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1505 transitions. [2023-08-30 20:48:30,840 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-30 20:48:30,841 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-30 20:48:30,841 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-30 20:48:30,841 INFO L175 Difference]: Start difference. First operand has 556 places, 2550 transitions, 77485 flow. Second operand 10 states and 1505 transitions. [2023-08-30 20:48:30,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 2081 transitions, 62266 flow [2023-08-30 20:48:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 2081 transitions, 60641 flow, removed 301 selfloop flow, removed 10 redundant places. [2023-08-30 20:48:38,727 INFO L231 Difference]: Finished difference. Result has 544 places, 1850 transitions, 51127 flow [2023-08-30 20:48:38,729 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-30 20:48:38,729 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-08-30 20:48:38,729 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 1850 transitions, 51127 flow [2023-08-30 20:48:38,730 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-30 20:48:38,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:48:38,730 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-30 20:48:38,738 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-30 20:48:38,936 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-30 20:48:38,936 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-30 20:48:38,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:48:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 955848005, now seen corresponding path program 3 times [2023-08-30 20:48:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:48:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315552786] [2023-08-30 20:48:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:48:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:48:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:48:39,034 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-30 20:48:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:48:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315552786] [2023-08-30 20:48:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315552786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:48:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937900942] [2023-08-30 20:48:39,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:48:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:48:39,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:48:39,039 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-30 20:48:39,040 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-30 20:48:39,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:48:39,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:48:39,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 20:48:39,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:48:39,284 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-30 20:48:39,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:48:39,354 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-30 20:48:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937900942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:48:39,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:48:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-08-30 20:48:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424064381] [2023-08-30 20:48:39,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:48:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 20:48:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:48:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 20:48:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-08-30 20:48:39,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-30 20:48:39,745 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-30 20:48:39,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:48:39,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-30 20:48:39,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:48:48,483 INFO L130 PetriNetUnfolder]: 11295/18824 cut-off events. [2023-08-30 20:48:48,483 INFO L131 PetriNetUnfolder]: For 676170/676362 co-relation queries the response was YES. [2023-08-30 20:48:48,690 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-30 20:48:48,786 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1708 selfloop transitions, 470 changer transitions 106/2333 dead transitions. [2023-08-30 20:48:48,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 2333 transitions, 65367 flow [2023-08-30 20:48:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 20:48:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 20:48:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3256 transitions. [2023-08-30 20:48:48,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192634560906516 [2023-08-30 20:48:48,789 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3256 transitions. [2023-08-30 20:48:48,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3256 transitions. [2023-08-30 20:48:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:48:48,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3256 transitions. [2023-08-30 20:48:48,792 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-30 20:48:48,794 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-30 20:48:48,795 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-30 20:48:48,795 INFO L175 Difference]: Start difference. First operand has 544 places, 1850 transitions, 51127 flow. Second operand 22 states and 3256 transitions. [2023-08-30 20:48:48,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 2333 transitions, 65367 flow [2023-08-30 20:48:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 2333 transitions, 63972 flow, removed 229 selfloop flow, removed 30 redundant places. [2023-08-30 20:48:54,783 INFO L231 Difference]: Finished difference. Result has 527 places, 1823 transitions, 50287 flow [2023-08-30 20:48:54,784 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-30 20:48:54,784 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 494 predicate places. [2023-08-30 20:48:54,784 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 1823 transitions, 50287 flow [2023-08-30 20:48:54,785 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-30 20:48:54,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:48:54,785 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-30 20:48:54,790 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-30 20:48:54,985 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-30 20:48:54,986 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-30 20:48:54,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:48:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1680272153, now seen corresponding path program 4 times [2023-08-30 20:48:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:48:54,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102069815] [2023-08-30 20:48:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:48:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:48:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:48:55,079 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-30 20:48:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:48:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102069815] [2023-08-30 20:48:55,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102069815] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:48:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850610012] [2023-08-30 20:48:55,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:48:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:48:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:48:55,081 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-30 20:48:55,083 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-30 20:48:55,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:48:55,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:48:55,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 20:48:55,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:48:55,308 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-30 20:48:55,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:48:55,379 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-30 20:48:55,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850610012] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:48:55,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:48:55,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-30 20:48:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074425024] [2023-08-30 20:48:55,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:48:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 20:48:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:48:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 20:48:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-30 20:48:55,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-08-30 20:48:55,720 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-30 20:48:55,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:48:55,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-08-30 20:48:55,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15