./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 BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:40:28,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:40:28,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:40:28,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:40:28,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:40:28,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:40:28,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:40:28,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:40:28,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:40:28,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:40:28,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:40:28,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:40:28,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:40:28,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:40:28,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:40:28,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:40:28,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:40:28,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:40:28,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:40:28,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:40:28,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:40:28,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:40:28,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:40:28,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:40:28,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:40:28,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:40:28,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:40:28,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:40:28,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:40:28,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:40:28,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:40:28,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:40:28,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:40:28,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:40:28,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:40:28,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:40:28,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:40:28,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:40:28,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:40:28,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:40:28,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:40:28,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:40:28,376 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:40:28,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:40:28,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:40:28,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:40:28,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:40:28,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:40:28,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:40:28,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:40:28,379 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:40:28,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:40:28,380 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:40:28,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:40:28,381 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:40:28,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:40:28,382 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:40:28,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:40:28,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:40:28,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:40:28,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:40:28,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:40:28,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:40:28,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:40:28,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:40:28,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:40:28,384 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:40:28,385 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 -> BEFORE [2023-09-01 13:40:28,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:40:28,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:40:28,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:40:28,669 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:40:28,669 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:40:28,670 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-09-01 13:40:29,691 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:40:29,872 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:40:29,873 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-09-01 13:40:29,878 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c616e432f/48573a4e450b4509a20e4bca85a0d8e7/FLAG1ada8e582 [2023-09-01 13:40:29,890 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c616e432f/48573a4e450b4509a20e4bca85a0d8e7 [2023-09-01 13:40:29,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:40:29,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:40:29,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:40:29,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:40:29,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:40:29,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:40:29" (1/1) ... [2023-09-01 13:40:29,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cbc25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:29, skipping insertion in model container [2023-09-01 13:40:29,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:40:29" (1/1) ... [2023-09-01 13:40:29,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:40:29,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:40:30,088 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-09-01 13:40:30,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:40:30,117 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:40:30,153 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-09-01 13:40:30,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:40:30,171 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:40:30,173 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:40:30,178 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:40:30,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30 WrapperNode [2023-09-01 13:40:30,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:40:30,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:40:30,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:40:30,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:40:30,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,235 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 284 [2023-09-01 13:40:30,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:40:30,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:40:30,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:40:30,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:40:30,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:40:30,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:40:30,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:40:30,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:40:30,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (1/1) ... [2023-09-01 13:40:30,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:40:30,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:40:30,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 13:40:30,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 13:40:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:40:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:40:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:40:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:40:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:40:30,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:40:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:40:30,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:40:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:40:30,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:40:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:40:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:40:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:40:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:40:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:40:30,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:40:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:40:30,378 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:40:30,567 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:40:30,574 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:40:30,955 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:40:31,196 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:40:31,196 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-09-01 13:40:31,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:40:31 BoogieIcfgContainer [2023-09-01 13:40:31,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:40:31,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:40:31,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:40:31,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:40:31,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:40:29" (1/3) ... [2023-09-01 13:40:31,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a0bc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:40:31, skipping insertion in model container [2023-09-01 13:40:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:40:30" (2/3) ... [2023-09-01 13:40:31,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a0bc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:40:31, skipping insertion in model container [2023-09-01 13:40:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:40:31" (3/3) ... [2023-09-01 13:40:31,205 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-09-01 13:40:31,211 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:40:31,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:40:31,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:40:31,219 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:40:31,297 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 13:40:31,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 183 transitions, 390 flow [2023-09-01 13:40:31,425 INFO L130 PetriNetUnfolder]: 16/180 cut-off events. [2023-09-01 13:40:31,425 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:40:31,430 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-09-01 13:40:31,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 183 transitions, 390 flow [2023-09-01 13:40:31,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 170 transitions, 358 flow [2023-09-01 13:40:31,459 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:40:31,466 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 170 transitions, 358 flow [2023-09-01 13:40:31,473 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 170 transitions, 358 flow [2023-09-01 13:40:31,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 358 flow [2023-09-01 13:40:31,554 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2023-09-01 13:40:31,554 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:40:31,556 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-09-01 13:40:31,558 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-09-01 13:40:37,036 INFO L134 LiptonReduction]: Checked pairs total: 2268 [2023-09-01 13:40:37,036 INFO L136 LiptonReduction]: Total number of compositions: 170 [2023-09-01 13:40:37,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:40:37,053 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;@143b0bcf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:40:37,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 13:40:37,061 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-09-01 13:40:37,061 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 13:40:37,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:40:37,062 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-09-01 13:40:37,062 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-09-01 13:40:37,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:40:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2134572771, now seen corresponding path program 1 times [2023-09-01 13:40:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:40:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157997519] [2023-09-01 13:40:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:40:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:40:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:40:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157997519] [2023-09-01 13:40:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157997519] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:40:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:40:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:40:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373112649] [2023-09-01 13:40:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:40:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:40:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:40:37,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:40:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:40:37,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 353 [2023-09-01 13:40:37,626 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-09-01 13:40:37,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:40:37,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 353 [2023-09-01 13:40:37,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:40:37,807 INFO L130 PetriNetUnfolder]: 531/736 cut-off events. [2023-09-01 13:40:37,807 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-09-01 13:40:37,811 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-09-01 13:40:37,816 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-09-01 13:40:37,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 176 flow [2023-09-01 13:40:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:40:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:40:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-09-01 13:40:37,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660056657223796 [2023-09-01 13:40:37,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-09-01 13:40:37,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-09-01 13:40:37,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:40:37,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-09-01 13:40:37,848 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-09-01 13:40:37,854 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-09-01 13:40:37,855 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-09-01 13:40:37,857 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 4 states and 658 transitions. [2023-09-01 13:40:37,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 176 flow [2023-09-01 13:40:37,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 13:40:37,864 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 83 flow [2023-09-01 13:40:37,865 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-09-01 13:40:37,870 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-09-01 13:40:37,871 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 83 flow [2023-09-01 13:40:37,873 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-09-01 13:40:37,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:40:37,875 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-09-01 13:40:37,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:40:37,877 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-09-01 13:40:37,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:40:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1985121884, now seen corresponding path program 1 times [2023-09-01 13:40:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:40:37,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278139035] [2023-09-01 13:40:37,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:37,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:40:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:40:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:40:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278139035] [2023-09-01 13:40:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278139035] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:40:38,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:40:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 13:40:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007117728] [2023-09-01 13:40:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:40:38,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 13:40:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:40:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 13:40:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 13:40:38,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 353 [2023-09-01 13:40:38,342 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-09-01 13:40:38,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:40:38,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 353 [2023-09-01 13:40:38,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:40:38,517 INFO L130 PetriNetUnfolder]: 532/741 cut-off events. [2023-09-01 13:40:38,517 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2023-09-01 13:40:38,519 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-09-01 13:40:38,521 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 34 selfloop transitions, 5 changer transitions 3/44 dead transitions. [2023-09-01 13:40:38,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 199 flow [2023-09-01 13:40:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:40:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:40:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2023-09-01 13:40:38,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343720491029273 [2023-09-01 13:40:38,525 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 920 transitions. [2023-09-01 13:40:38,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 920 transitions. [2023-09-01 13:40:38,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:40:38,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 920 transitions. [2023-09-01 13:40:38,528 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-09-01 13:40:38,531 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-09-01 13:40:38,532 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-09-01 13:40:38,532 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 83 flow. Second operand 6 states and 920 transitions. [2023-09-01 13:40:38,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 199 flow [2023-09-01 13:40:38,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 13:40:38,536 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 109 flow [2023-09-01 13:40:38,536 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-09-01 13:40:38,537 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-09-01 13:40:38,537 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 109 flow [2023-09-01 13:40:38,537 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-09-01 13:40:38,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:40:38,538 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-09-01 13:40:38,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:40:38,538 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-09-01 13:40:38,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:40:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash 963886311, now seen corresponding path program 1 times [2023-09-01 13:40:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:40:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984907598] [2023-09-01 13:40:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:40:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:40:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:40:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984907598] [2023-09-01 13:40:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984907598] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:40:38,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135384807] [2023-09-01 13:40:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:40:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:40:38,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:40:38,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 13:40:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:38,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 13:40:38,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:40:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:40:38,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:40:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:40:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135384807] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:40:38,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:40:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-09-01 13:40:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926053578] [2023-09-01 13:40:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:40:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:40:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:40:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:40:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-09-01 13:40:38,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-09-01 13:40:38,998 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-09-01 13:40:38,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:40:38,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-09-01 13:40:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:40:39,143 INFO L130 PetriNetUnfolder]: 508/732 cut-off events. [2023-09-01 13:40:39,144 INFO L131 PetriNetUnfolder]: For 179/215 co-relation queries the response was YES. [2023-09-01 13:40:39,145 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-09-01 13:40:39,147 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-09-01 13:40:39,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 233 flow [2023-09-01 13:40:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:40:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:40:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-09-01 13:40:39,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43059490084985835 [2023-09-01 13:40:39,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-09-01 13:40:39,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-09-01 13:40:39,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:40:39,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-09-01 13:40:39,152 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-09-01 13:40:39,155 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-09-01 13:40:39,155 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-09-01 13:40:39,156 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 109 flow. Second operand 5 states and 760 transitions. [2023-09-01 13:40:39,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 233 flow [2023-09-01 13:40:39,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 227 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 13:40:39,173 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 119 flow [2023-09-01 13:40:39,174 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-09-01 13:40:39,174 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-09-01 13:40:39,175 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 119 flow [2023-09-01 13:40:39,175 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-09-01 13:40:39,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:40:39,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:40:39,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 13:40:39,376 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-09-01 13:40:39,376 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-09-01 13:40:39,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:40:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1831077328, now seen corresponding path program 1 times [2023-09-01 13:40:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:40:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125917979] [2023-09-01 13:40:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:40:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:40:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:40:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125917979] [2023-09-01 13:40:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125917979] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:40:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686935332] [2023-09-01 13:40:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:40:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:40:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:40:41,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:40:41,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 13:40:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:40:41,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 81 conjunts are in the unsatisfiable core [2023-09-01 13:40:41,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:40:41,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 13:40:42,013 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-09-01 13:40:42,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:40:42,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:40:42,320 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-01 13:40:42,320 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-09-01 13:40:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:40:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:40:42,489 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-01 13:40:42,489 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-09-01 13:40:42,634 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:40:42,635 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-09-01 13:40:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:40:42,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:40:42,961 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-09-01 13:40:43,038 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-09-01 13:40:43,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:40:43,397 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-09-01 13:40:43,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:40:43,527 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-09-01 13:40:44,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:40:44,360 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-09-01 13:40:44,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:40:44,438 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-09-01 13:40:44,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:40:44,534 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-09-01 13:40:54,342 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:40:55,891 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:40:56,683 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:40:56,769 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:40:57,094 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:40:57,407 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:40:57,567 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:40:57,661 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:40:57,708 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:40:57,756 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:40:57,953 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:40:58,354 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:40:58,555 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:40:58,891 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:40:59,757 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:40:59,975 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:00,235 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:00,333 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:00,463 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:00,850 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:00,899 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:00,998 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:01,221 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:01,272 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:01,422 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:01,467 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:01,525 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:01,598 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:01,764 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:02,500 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:02,587 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:02,645 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:02,709 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:02,719 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:03,206 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:03,234 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:03,301 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:03,349 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:05,194 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:05,295 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:05,316 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:05,658 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:05,671 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:05,851 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:05,891 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:06,533 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:06,933 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:07,399 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:07,608 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:07,625 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:07,765 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:08,491 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:08,520 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:08,654 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:08,879 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:08,894 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:09,064 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:09,384 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:09,713 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:09,793 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:10,688 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:11,565 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:12,294 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:41:13,885 WARN L718 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-09-01 13:41:14,083 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:14,725 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:41:14,960 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:15,020 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:15,342 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:15,395 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:15,446 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:15,463 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:15,811 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:16,010 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:16,319 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:16,485 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:16,954 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:17,027 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:17,111 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:17,271 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:17,541 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:18,065 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:18,152 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:18,191 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:18,440 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:18,520 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:18,569 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:18,632 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:18,765 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:18,836 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:19,154 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:19,213 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:19,308 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:19,380 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:19,771 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:19,828 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:19,857 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:19,907 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:20,206 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:20,228 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:20,520 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:20,582 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:20,634 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:20,907 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:21,090 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:21,309 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:21,419 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:21,435 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:21,620 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:21,782 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:21,870 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:41:21,891 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:22,550 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:23,212 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:23,529 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:23,794 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:23,828 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:24,111 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:24,265 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:24,391 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:24,473 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:24,626 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:24,661 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:24,729 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:24,819 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:24,900 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:25,047 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:25,121 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:25,185 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:25,289 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:25,460 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:25,554 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:25,681 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:25,892 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:25,936 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:26,003 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:26,064 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:26,430 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:26,448 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:26,459 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:26,678 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:26,704 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:26,727 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:26,749 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:26,767 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:27,117 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:27,156 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:27,218 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:27,268 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:27,403 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:27,505 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:27,536 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:27,559 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:27,685 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:27,935 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:28,069 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:28,137 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:28,325 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:28,386 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:28,409 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:28,427 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:28,543 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:28,688 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:28,767 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:28,877 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:28,910 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:29,052 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:29,197 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:29,216 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:29,517 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,561 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:29,633 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,683 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:29,768 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:29,809 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,849 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:29,862 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,883 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,933 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:29,947 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:30,139 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:30,244 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:30,366 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:30,532 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:30,804 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:31,073 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:31,145 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:31,179 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:31,246 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:31,484 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:31,610 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:31,673 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:31,713 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:31,813 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:31,942 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:31,958 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:32,070 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:32,193 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:32,276 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:32,346 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:32,440 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:32,514 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:32,537 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:32,562 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:32,583 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:32,633 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:32,645 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:32,683 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:32,694 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:32,701 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:32,757 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:32,769 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:32,790 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:32,814 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:32,980 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:33,050 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:33,076 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:33,105 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:33,166 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:33,189 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:33,354 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:33,371 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:33,831 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:33,888 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:33,902 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:33,935 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:33,971 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:34,365 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,454 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,507 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:34,529 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,592 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:34,606 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,701 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,714 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:34,776 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:34,798 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,811 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:34,844 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:34,931 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:34,965 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:34,984 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:35,003 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:35,105 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:35,130 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:35,148 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:35,164 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:35,865 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:35,907 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:36,253 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:36,311 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:37,312 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:37,761 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:38,239 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:38,291 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:38,415 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:38,669 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:38,760 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:38,827 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:39,005 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:39,037 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:39,184 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:39,304 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:39,420 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:39,496 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:39,760 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:39,825 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:39,956 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:40,070 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:40,086 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:40,251 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:40,311 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:40,439 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:40,492 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:40,544 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:40,606 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:40,682 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:40,694 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:40,714 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:40,737 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:40,972 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:41,134 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:41,233 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:41,767 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:42,083 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:42,101 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:42,446 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:42,552 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:41:43,178 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:41:43,298 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:43,557 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:43,838 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:44,143 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:44,195 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:44,310 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:44,459 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:44,475 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:44,593 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:44,743 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:44,899 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:45,084 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:45,232 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:41:45,253 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:45,614 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:45,654 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:45,667 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:45,827 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:45,882 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:46,201 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:41:46,365 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:41:46,474 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:46,539 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:46,724 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:47,218 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:47,699 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:47,727 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:47,797 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:47,853 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:49,737 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:52,071 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:52,980 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:53,396 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:53,436 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:53,655 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:53,780 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:53,796 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:53,819 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:53,926 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:53,977 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:54,005 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:55,031 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:55,365 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:55,379 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:55,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:55,442 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:41:55,647 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:55,698 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:41:55,727 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:41:55,734 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:04,368 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:05,363 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:05,511 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:06,076 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:06,143 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:06,427 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:42:06,507 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:07,287 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:08,169 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:08,871 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:42:10,444 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:11,006 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:11,441 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:11,558 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:11,581 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:11,710 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:12,123 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:12,323 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:12,364 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:12,835 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:12,867 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:12,888 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:12,991 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:13,047 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:13,336 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:42:13,413 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:13,716 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:14,039 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:14,361 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:14,533 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:14,948 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:42:14,967 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:15,530 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:15,637 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:15,907 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:15,928 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:16,433 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:16,451 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:16,598 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:17,345 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:17,475 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:17,544 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:18,395 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:42:18,836 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:20,043 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:20,073 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:20,227 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:20,506 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:42:20,616 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:20,993 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:21,680 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:42:22,777 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:22,792 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:22,812 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:22,868 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:22,893 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:22,917 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:23,246 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:23,264 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:23,285 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:23,295 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:23,421 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:23,440 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:23,460 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:23,588 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:23,697 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:23,819 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:23,893 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:23,922 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:24,941 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:25,117 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:25,248 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:25,928 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:26,409 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:26,497 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:26,835 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:26,872 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:27,033 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:27,669 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:28,086 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:42:30,894 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:31,060 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:31,370 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:31,449 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:31,574 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:31,677 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:42:32,515 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:32,669 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:34,254 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:34,471 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:38,848 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:41,803 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:41,972 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:46,044 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:46,546 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:46,590 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:46,873 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:47,020 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:47,043 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:47,072 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:47,197 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:47,255 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:47,286 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:48,146 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:48,600 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:48,657 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:48,689 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:48,699 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:50,087 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:50,128 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:50,384 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:50,528 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:50,547 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:50,576 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:50,706 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:50,765 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:50,803 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:51,743 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:51,786 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:52,116 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:52,478 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:52,494 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:52,545 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:52,568 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:52,799 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:52,866 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:52,904 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:52,913 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:56,364 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:56,883 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:56,910 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:58,056 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:58,077 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:58,096 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:58,122 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:58,148 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:42:58,161 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:58,176 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:42:58,501 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:58,517 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:58,608 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:58,674 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:42:58,732 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:42:58,901 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:59,625 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:42:59,651 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:00,431 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:00,483 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:00,802 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:00,818 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:00,835 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:00,863 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:00,976 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:01,080 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:01,478 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:07,410 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:08,693 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:09,232 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:09,433 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:09,585 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:09,857 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:10,263 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:10,681 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:11,272 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:11,319 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:11,370 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:11,554 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:11,679 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:11,691 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:11,710 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:11,748 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:11,868 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:11,885 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:11,914 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:11,945 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:11,966 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:12,011 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:12,039 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:12,192 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:13,375 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:15,591 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:43:16,693 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:43:16,714 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:16,982 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:17,343 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-09-01 13:43:17,366 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:17,980 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:18,862 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:18,982 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:19,098 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:19,172 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:19,203 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:19,227 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:19,589 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:19,625 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:19,780 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:19,816 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:21,097 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:21,925 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:22,532 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:22,895 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:22,932 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:23,089 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:23,124 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:23,683 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:23,708 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:23,763 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:23,824 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:23,849 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:23,944 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:24,118 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:24,462 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:25,014 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:25,457 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-09-01 13:43:26,029 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-09-01 13:43:27,120 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:27,972 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:28,134 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:28,321 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:29,089 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:29,138 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:29,164 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-09-01 13:43:29,189 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-09-01 13:43:29,676 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:30,314 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:30,428 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:30,459 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:30,536 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:30,549 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:30,745 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:30,785 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-09-01 13:43:30,900 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:30,933 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:31,010 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-09-01 13:43:32,938 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:41,180 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:43:41,616 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-09-01 13:44:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 13:44:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686935332] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:08,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:08,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2023-09-01 13:44:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079655620] [2023-09-01 13:44:08,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:08,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 13:44:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 13:44:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1035, Unknown=27, NotChecked=134, Total=1332 [2023-09-01 13:44:08,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 353 [2023-09-01 13:44:08,882 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-09-01 13:44:08,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:08,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 353 [2023-09-01 13:44:08,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:12,817 INFO L130 PetriNetUnfolder]: 2209/3256 cut-off events. [2023-09-01 13:44:12,817 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2023-09-01 13:44:12,822 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-09-01 13:44:12,836 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 238 selfloop transitions, 101 changer transitions 9/348 dead transitions. [2023-09-01 13:44:12,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 348 transitions, 1765 flow [2023-09-01 13:44:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-01 13:44:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-09-01 13:44:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3296 transitions. [2023-09-01 13:44:12,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25936418004406675 [2023-09-01 13:44:12,847 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3296 transitions. [2023-09-01 13:44:12,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3296 transitions. [2023-09-01 13:44:12,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:12,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3296 transitions. [2023-09-01 13:44:12,856 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-09-01 13:44:12,871 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-09-01 13:44:12,874 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-09-01 13:44:12,874 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 119 flow. Second operand 36 states and 3296 transitions. [2023-09-01 13:44:12,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 348 transitions, 1765 flow [2023-09-01 13:44:12,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 348 transitions, 1737 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-09-01 13:44:12,889 INFO L231 Difference]: Finished difference. Result has 89 places, 131 transitions, 856 flow [2023-09-01 13:44:12,889 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-09-01 13:44:12,891 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2023-09-01 13:44:12,891 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 131 transitions, 856 flow [2023-09-01 13:44:12,893 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-09-01 13:44:12,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:44:12,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:44:12,903 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-09-01 13:44:13,100 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-09-01 13:44:13,100 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-09-01 13:44:13,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:44:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash 550186672, now seen corresponding path program 2 times [2023-09-01 13:44:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:44:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158936765] [2023-09-01 13:44:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:44:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:44:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:44:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:44:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:44:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158936765] [2023-09-01 13:44:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158936765] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:44:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745659953] [2023-09-01 13:44:14,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:44:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:44:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:44:14,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:44:14,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 13:44:14,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:44:14,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:44:14,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 58 conjunts are in the unsatisfiable core [2023-09-01 13:44:14,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:44:15,084 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:44:15,084 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-09-01 13:44:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:15,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:44:15,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:44:15,302 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-09-01 13:44:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745659953] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:15,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-09-01 13:44:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022618140] [2023-09-01 13:44:15,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 13:44:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 13:44:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2023-09-01 13:44:17,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-09-01 13:44:17,520 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-09-01 13:44:17,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:17,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-09-01 13:44:17,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:19,408 INFO L130 PetriNetUnfolder]: 2579/3907 cut-off events. [2023-09-01 13:44:19,408 INFO L131 PetriNetUnfolder]: For 9109/9109 co-relation queries the response was YES. [2023-09-01 13:44:19,420 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-09-01 13:44:19,439 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 172 selfloop transitions, 142 changer transitions 19/333 dead transitions. [2023-09-01 13:44:19,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 333 transitions, 2624 flow [2023-09-01 13:44:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-01 13:44:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-09-01 13:44:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2817 transitions. [2023-09-01 13:44:19,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469639118117995 [2023-09-01 13:44:19,447 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2817 transitions. [2023-09-01 13:44:19,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2817 transitions. [2023-09-01 13:44:19,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:19,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2817 transitions. [2023-09-01 13:44:19,453 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-09-01 13:44:19,462 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-09-01 13:44:19,464 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-09-01 13:44:19,464 INFO L175 Difference]: Start difference. First operand has 89 places, 131 transitions, 856 flow. Second operand 23 states and 2817 transitions. [2023-09-01 13:44:19,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 333 transitions, 2624 flow [2023-09-01 13:44:19,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 333 transitions, 2592 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-09-01 13:44:19,529 INFO L231 Difference]: Finished difference. Result has 120 places, 223 transitions, 2088 flow [2023-09-01 13:44:19,529 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-09-01 13:44:19,532 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 87 predicate places. [2023-09-01 13:44:19,532 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 223 transitions, 2088 flow [2023-09-01 13:44:19,533 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-09-01 13:44:19,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:44:19,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:44:19,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 13:44:19,741 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-09-01 13:44:19,741 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-09-01 13:44:19,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:44:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1216314062, now seen corresponding path program 3 times [2023-09-01 13:44:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:44:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426446439] [2023-09-01 13:44:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:44:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:44:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:44:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:44:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:44:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426446439] [2023-09-01 13:44:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426446439] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:44:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363676310] [2023-09-01 13:44:20,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:44:20,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:44:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:44:20,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:44:20,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 13:44:20,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 13:44:20,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:44:20,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-01 13:44:20,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:44:20,934 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:44:20,935 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-09-01 13:44:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:44:20,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:44:21,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:44:21,104 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-09-01 13:44:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:44:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363676310] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:21,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:21,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-09-01 13:44:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168873099] [2023-09-01 13:44:21,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-09-01 13:44:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-09-01 13:44:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-09-01 13:44:22,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 353 [2023-09-01 13:44:22,563 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-09-01 13:44:22,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:22,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 353 [2023-09-01 13:44:22,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:24,375 INFO L130 PetriNetUnfolder]: 3615/5472 cut-off events. [2023-09-01 13:44:24,376 INFO L131 PetriNetUnfolder]: For 22945/23105 co-relation queries the response was YES. [2023-09-01 13:44:24,392 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-09-01 13:44:24,418 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 226 selfloop transitions, 290 changer transitions 6/528 dead transitions. [2023-09-01 13:44:24,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 528 transitions, 5269 flow [2023-09-01 13:44:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-01 13:44:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-09-01 13:44:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4520 transitions. [2023-09-01 13:44:24,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3766038993501083 [2023-09-01 13:44:24,430 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4520 transitions. [2023-09-01 13:44:24,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4520 transitions. [2023-09-01 13:44:24,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:24,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4520 transitions. [2023-09-01 13:44:24,440 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-09-01 13:44:24,454 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-09-01 13:44:24,456 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-09-01 13:44:24,457 INFO L175 Difference]: Start difference. First operand has 120 places, 223 transitions, 2088 flow. Second operand 34 states and 4520 transitions. [2023-09-01 13:44:24,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 528 transitions, 5269 flow [2023-09-01 13:44:24,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 528 transitions, 5077 flow, removed 89 selfloop flow, removed 5 redundant places. [2023-09-01 13:44:24,644 INFO L231 Difference]: Finished difference. Result has 153 places, 371 transitions, 4141 flow [2023-09-01 13:44:24,644 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-09-01 13:44:24,645 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2023-09-01 13:44:24,645 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 371 transitions, 4141 flow [2023-09-01 13:44:24,646 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-09-01 13:44:24,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:44:24,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:44:24,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 13:44:24,852 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-09-01 13:44:24,852 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-09-01 13:44:24,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:44:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1145552732, now seen corresponding path program 4 times [2023-09-01 13:44:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:44:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726669332] [2023-09-01 13:44:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:44:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:44:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:44:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:44:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:44:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726669332] [2023-09-01 13:44:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726669332] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:44:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733779256] [2023-09-01 13:44:26,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 13:44:26,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:44:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:44:26,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:44:26,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 13:44:26,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 13:44:26,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:44:26,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-09-01 13:44:26,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:44:26,496 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:44:26,496 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-09-01 13:44:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:26,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:44:26,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:44:26,683 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-09-01 13:44:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733779256] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:26,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 29 [2023-09-01 13:44:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720518239] [2023-09-01 13:44:26,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:26,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 13:44:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:26,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 13:44:26,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2023-09-01 13:44:29,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-09-01 13:44:29,605 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-09-01 13:44:29,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:29,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-09-01 13:44:29,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:36,146 INFO L130 PetriNetUnfolder]: 6340/9484 cut-off events. [2023-09-01 13:44:36,146 INFO L131 PetriNetUnfolder]: For 51057/51057 co-relation queries the response was YES. [2023-09-01 13:44:36,168 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-09-01 13:44:36,217 INFO L137 encePairwiseOnDemand]: 335/353 looper letters, 465 selfloop transitions, 718 changer transitions 10/1193 dead transitions. [2023-09-01 13:44:36,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1193 transitions, 13522 flow [2023-09-01 13:44:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-09-01 13:44:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-09-01 13:44:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 9023 transitions. [2023-09-01 13:44:36,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34081208687440984 [2023-09-01 13:44:36,249 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 9023 transitions. [2023-09-01 13:44:36,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 9023 transitions. [2023-09-01 13:44:36,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:36,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 9023 transitions. [2023-09-01 13:44:36,271 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-09-01 13:44:36,302 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-09-01 13:44:36,307 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-09-01 13:44:36,307 INFO L175 Difference]: Start difference. First operand has 153 places, 371 transitions, 4141 flow. Second operand 75 states and 9023 transitions. [2023-09-01 13:44:36,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1193 transitions, 13522 flow [2023-09-01 13:44:36,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1193 transitions, 13069 flow, removed 105 selfloop flow, removed 11 redundant places. [2023-09-01 13:44:36,796 INFO L231 Difference]: Finished difference. Result has 236 places, 906 transitions, 11904 flow [2023-09-01 13:44:36,796 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-09-01 13:44:36,797 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 203 predicate places. [2023-09-01 13:44:36,797 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 906 transitions, 11904 flow [2023-09-01 13:44:36,798 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-09-01 13:44:36,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:44:36,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:44:36,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 13:44:37,003 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-09-01 13:44:37,004 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-09-01 13:44:37,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:44:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1850509082, now seen corresponding path program 5 times [2023-09-01 13:44:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:44:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374489632] [2023-09-01 13:44:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:44:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:44:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:44:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:44:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:44:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374489632] [2023-09-01 13:44:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374489632] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:44:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953896009] [2023-09-01 13:44:38,310 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 13:44:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:44:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:44:38,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:44:38,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 13:44:38,418 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-09-01 13:44:38,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:44:38,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 59 conjunts are in the unsatisfiable core [2023-09-01 13:44:38,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:44:38,641 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:44:38,642 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-09-01 13:44:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:38,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:44:38,882 INFO L321 Elim1Store]: treesize reduction 57, result has 26.0 percent of original size [2023-09-01 13:44:38,882 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-09-01 13:44:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:44:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953896009] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:38,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 6] total 27 [2023-09-01 13:44:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159371067] [2023-09-01 13:44:38,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-01 13:44:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-01 13:44:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-09-01 13:44:40,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-09-01 13:44:40,964 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-09-01 13:44:40,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:40,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-09-01 13:44:40,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:46,194 INFO L130 PetriNetUnfolder]: 8536/13011 cut-off events. [2023-09-01 13:44:46,195 INFO L131 PetriNetUnfolder]: For 129116/129116 co-relation queries the response was YES. [2023-09-01 13:44:46,234 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-09-01 13:44:46,295 INFO L137 encePairwiseOnDemand]: 334/353 looper letters, 575 selfloop transitions, 1056 changer transitions 28/1659 dead transitions. [2023-09-01 13:44:46,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1659 transitions, 23226 flow [2023-09-01 13:44:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-09-01 13:44:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-09-01 13:44:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5808 transitions. [2023-09-01 13:44:46,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35006931468868663 [2023-09-01 13:44:46,303 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 5808 transitions. [2023-09-01 13:44:46,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 5808 transitions. [2023-09-01 13:44:46,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:46,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 5808 transitions. [2023-09-01 13:44:46,312 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-09-01 13:44:46,322 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-09-01 13:44:46,324 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-09-01 13:44:46,324 INFO L175 Difference]: Start difference. First operand has 236 places, 906 transitions, 11904 flow. Second operand 47 states and 5808 transitions. [2023-09-01 13:44:46,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1659 transitions, 23226 flow [2023-09-01 13:44:47,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1659 transitions, 22531 flow, removed 333 selfloop flow, removed 5 redundant places. [2023-09-01 13:44:47,401 INFO L231 Difference]: Finished difference. Result has 291 places, 1369 transitions, 20857 flow [2023-09-01 13:44:47,402 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-09-01 13:44:47,402 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 258 predicate places. [2023-09-01 13:44:47,402 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1369 transitions, 20857 flow [2023-09-01 13:44:47,403 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-09-01 13:44:47,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:44:47,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:44:47,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 13:44:47,604 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-09-01 13:44:47,604 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-09-01 13:44:47,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:44:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1223354686, now seen corresponding path program 6 times [2023-09-01 13:44:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:44:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101246509] [2023-09-01 13:44:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:44:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:44:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:44:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:44:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:44:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101246509] [2023-09-01 13:44:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101246509] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:44:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850795928] [2023-09-01 13:44:48,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 13:44:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:44:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:44:48,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:44:48,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 13:44:48,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 13:44:48,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:44:48,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-01 13:44:48,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:44:49,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:44:49,200 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-09-01 13:44:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:44:49,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:44:49,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:44:49,346 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-09-01 13:44:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:44:49,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850795928] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:44:49,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:44:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-09-01 13:44:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082315861] [2023-09-01 13:44:49,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:44:49,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 13:44:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:44:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 13:44:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2023-09-01 13:44:51,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-09-01 13:44:51,698 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-09-01 13:44:51,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:44:51,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-09-01 13:44:51,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:44:57,622 INFO L130 PetriNetUnfolder]: 9040/13746 cut-off events. [2023-09-01 13:44:57,622 INFO L131 PetriNetUnfolder]: For 172332/172332 co-relation queries the response was YES. [2023-09-01 13:44:57,765 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-09-01 13:44:57,843 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 721 selfloop transitions, 1039 changer transitions 9/1769 dead transitions. [2023-09-01 13:44:57,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1769 transitions, 28978 flow [2023-09-01 13:44:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-09-01 13:44:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-09-01 13:44:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 4639 transitions. [2023-09-01 13:44:57,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3369652066535919 [2023-09-01 13:44:57,858 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 4639 transitions. [2023-09-01 13:44:57,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 4639 transitions. [2023-09-01 13:44:57,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:44:57,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 4639 transitions. [2023-09-01 13:44:57,871 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-09-01 13:44:57,884 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-09-01 13:44:57,885 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-09-01 13:44:57,885 INFO L175 Difference]: Start difference. First operand has 291 places, 1369 transitions, 20857 flow. Second operand 39 states and 4639 transitions. [2023-09-01 13:44:57,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1769 transitions, 28978 flow [2023-09-01 13:45:00,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1769 transitions, 27729 flow, removed 453 selfloop flow, removed 9 redundant places. [2023-09-01 13:45:00,361 INFO L231 Difference]: Finished difference. Result has 327 places, 1565 transitions, 26198 flow [2023-09-01 13:45:00,362 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-09-01 13:45:00,363 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 294 predicate places. [2023-09-01 13:45:00,363 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 1565 transitions, 26198 flow [2023-09-01 13:45:00,364 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-09-01 13:45:00,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:00,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:00,369 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-09-01 13:45:00,564 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-09-01 13:45:00,565 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-09-01 13:45:00,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1789474852, now seen corresponding path program 7 times [2023-09-01 13:45:00,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:00,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461859198] [2023-09-01 13:45:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:00,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461859198] [2023-09-01 13:45:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461859198] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632101399] [2023-09-01 13:45:01,228 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 13:45:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:01,229 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-09-01 13:45:01,234 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-09-01 13:45:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:01,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjunts are in the unsatisfiable core [2023-09-01 13:45:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:01,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 13:45:01,690 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-09-01 13:45:01,691 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-09-01 13:45:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:01,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:01,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:01,793 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-09-01 13:45:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632101399] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:45:02,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:45:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2023-09-01 13:45:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941005116] [2023-09-01 13:45:02,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:45:02,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-09-01 13:45:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-09-01 13:45:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-09-01 13:45:03,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 353 [2023-09-01 13:45:03,316 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-09-01 13:45:03,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:03,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 353 [2023-09-01 13:45:03,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:09,181 INFO L130 PetriNetUnfolder]: 10804/16522 cut-off events. [2023-09-01 13:45:09,181 INFO L131 PetriNetUnfolder]: For 213024/213143 co-relation queries the response was YES. [2023-09-01 13:45:09,250 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-09-01 13:45:09,317 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 993 selfloop transitions, 1210 changer transitions 5/2235 dead transitions. [2023-09-01 13:45:09,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 2235 transitions, 39982 flow [2023-09-01 13:45:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-01 13:45:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-09-01 13:45:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4460 transitions. [2023-09-01 13:45:09,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3716047325445759 [2023-09-01 13:45:09,323 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4460 transitions. [2023-09-01 13:45:09,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4460 transitions. [2023-09-01 13:45:09,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:09,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4460 transitions. [2023-09-01 13:45:09,330 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-09-01 13:45:09,336 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-09-01 13:45:09,337 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-09-01 13:45:09,338 INFO L175 Difference]: Start difference. First operand has 327 places, 1565 transitions, 26198 flow. Second operand 34 states and 4460 transitions. [2023-09-01 13:45:09,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 2235 transitions, 39982 flow [2023-09-01 13:45:12,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 2235 transitions, 39299 flow, removed 89 selfloop flow, removed 15 redundant places. [2023-09-01 13:45:12,910 INFO L231 Difference]: Finished difference. Result has 358 places, 1960 transitions, 37270 flow [2023-09-01 13:45:12,911 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-09-01 13:45:12,911 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 325 predicate places. [2023-09-01 13:45:12,911 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1960 transitions, 37270 flow [2023-09-01 13:45:12,912 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-09-01 13:45:12,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:12,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:12,920 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-09-01 13:45:13,114 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-09-01 13:45:13,115 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-09-01 13:45:13,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1064531612, now seen corresponding path program 8 times [2023-09-01 13:45:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243034443] [2023-09-01 13:45:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243034443] [2023-09-01 13:45:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243034443] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926120390] [2023-09-01 13:45:14,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:45:14,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:14,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:14,115 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-09-01 13:45:14,116 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-09-01 13:45:14,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:45:14,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:45:14,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2023-09-01 13:45:14,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:14,659 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:45:14,660 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-09-01 13:45:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:14,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:14,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:14,832 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-09-01 13:45:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926120390] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:45:15,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:45:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 33 [2023-09-01 13:45:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350659012] [2023-09-01 13:45:15,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:45:15,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 13:45:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 13:45:15,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2023-09-01 13:45:17,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 353 [2023-09-01 13:45:17,697 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-09-01 13:45:17,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:17,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 353 [2023-09-01 13:45:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:30,869 INFO L130 PetriNetUnfolder]: 14020/21192 cut-off events. [2023-09-01 13:45:30,869 INFO L131 PetriNetUnfolder]: For 329859/329859 co-relation queries the response was YES. [2023-09-01 13:45:30,976 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-09-01 13:45:31,076 INFO L137 encePairwiseOnDemand]: 336/353 looper letters, 720 selfloop transitions, 2274 changer transitions 6/3000 dead transitions. [2023-09-01 13:45:31,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 3000 transitions, 58069 flow [2023-09-01 13:45:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-09-01 13:45:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-09-01 13:45:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 11031 transitions. [2023-09-01 13:45:31,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3360138901580919 [2023-09-01 13:45:31,092 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 11031 transitions. [2023-09-01 13:45:31,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 11031 transitions. [2023-09-01 13:45:31,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:31,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 11031 transitions. [2023-09-01 13:45:31,111 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-09-01 13:45:31,133 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-09-01 13:45:31,137 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-09-01 13:45:31,137 INFO L175 Difference]: Start difference. First operand has 358 places, 1960 transitions, 37270 flow. Second operand 93 states and 11031 transitions. [2023-09-01 13:45:31,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 3000 transitions, 58069 flow [2023-09-01 13:45:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 3000 transitions, 57792 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-09-01 13:45:37,785 INFO L231 Difference]: Finished difference. Result has 460 places, 2713 transitions, 57124 flow [2023-09-01 13:45:37,786 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-09-01 13:45:37,787 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 427 predicate places. [2023-09-01 13:45:37,787 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 2713 transitions, 57124 flow [2023-09-01 13:45:37,788 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-09-01 13:45:37,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:37,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:37,797 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-09-01 13:45:37,994 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-09-01 13:45:37,994 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-09-01 13:45:37,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 228834432, now seen corresponding path program 9 times [2023-09-01 13:45:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723141554] [2023-09-01 13:45:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723141554] [2023-09-01 13:45:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723141554] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940025191] [2023-09-01 13:45:38,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:45:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:38,953 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-09-01 13:45:38,972 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-09-01 13:45:39,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 13:45:39,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:45:39,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-09-01 13:45:39,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:39,379 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:45:39,380 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-09-01 13:45:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:39,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:39,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:39,544 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-09-01 13:45:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940025191] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:45:39,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:45:39,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 30 [2023-09-01 13:45:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229931381] [2023-09-01 13:45:39,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:45:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 13:45:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 13:45:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2023-09-01 13:45:41,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 353 [2023-09-01 13:45:41,503 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-09-01 13:45:41,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:41,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 353 [2023-09-01 13:45:41,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:50,828 INFO L130 PetriNetUnfolder]: 14135/21419 cut-off events. [2023-09-01 13:45:50,828 INFO L131 PetriNetUnfolder]: For 404146/404146 co-relation queries the response was YES. [2023-09-01 13:45:50,953 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-09-01 13:45:51,048 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 1612 selfloop transitions, 1171 changer transitions 13/2796 dead transitions. [2023-09-01 13:45:51,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 2796 transitions, 63522 flow [2023-09-01 13:45:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 13:45:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 13:45:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1968 transitions. [2023-09-01 13:45:51,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34844192634560905 [2023-09-01 13:45:51,050 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1968 transitions. [2023-09-01 13:45:51,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1968 transitions. [2023-09-01 13:45:51,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:51,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1968 transitions. [2023-09-01 13:45:51,053 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-09-01 13:45:51,055 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-09-01 13:45:51,056 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-09-01 13:45:51,056 INFO L175 Difference]: Start difference. First operand has 460 places, 2713 transitions, 57124 flow. Second operand 16 states and 1968 transitions. [2023-09-01 13:45:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 2796 transitions, 63522 flow [2023-09-01 13:46:00,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2796 transitions, 62301 flow, removed 576 selfloop flow, removed 9 redundant places. [2023-09-01 13:46:00,813 INFO L231 Difference]: Finished difference. Result has 472 places, 2734 transitions, 60370 flow [2023-09-01 13:46:00,815 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-09-01 13:46:00,816 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 439 predicate places. [2023-09-01 13:46:00,816 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 2734 transitions, 60370 flow [2023-09-01 13:46:00,817 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-09-01 13:46:00,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:46:00,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:46:00,826 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-09-01 13:46:01,023 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-09-01 13:46:01,023 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-09-01 13:46:01,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:46:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -475621398, now seen corresponding path program 10 times [2023-09-01 13:46:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:46:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465504203] [2023-09-01 13:46:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:46:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:46:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:46:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:46:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:46:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465504203] [2023-09-01 13:46:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465504203] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:46:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361678805] [2023-09-01 13:46:01,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 13:46:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:46:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:46:01,922 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-09-01 13:46:01,923 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-09-01 13:46:02,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 13:46:02,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:46:02,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2023-09-01 13:46:02,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:46:02,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 13:46:02,448 INFO L321 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-09-01 13:46:02,448 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-09-01 13:46:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:02,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:46:02,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:46:02,583 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-09-01 13:46:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361678805] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:46:02,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:46:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2023-09-01 13:46:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322328629] [2023-09-01 13:46:02,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:46:02,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 13:46:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:46:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 13:46:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2023-09-01 13:46:04,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 353 [2023-09-01 13:46:04,543 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-09-01 13:46:04,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:46:04,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 353 [2023-09-01 13:46:04,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:46:14,485 INFO L130 PetriNetUnfolder]: 14151/21465 cut-off events. [2023-09-01 13:46:14,485 INFO L131 PetriNetUnfolder]: For 471086/471086 co-relation queries the response was YES. [2023-09-01 13:46:14,612 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-09-01 13:46:14,741 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1529 selfloop transitions, 1265 changer transitions 6/2800 dead transitions. [2023-09-01 13:46:14,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 2800 transitions, 66594 flow [2023-09-01 13:46:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 13:46:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 13:46:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2342 transitions. [2023-09-01 13:46:14,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33172804532577904 [2023-09-01 13:46:14,743 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2342 transitions. [2023-09-01 13:46:14,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2342 transitions. [2023-09-01 13:46:14,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:46:14,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2342 transitions. [2023-09-01 13:46:14,747 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-09-01 13:46:14,751 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-09-01 13:46:14,751 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-09-01 13:46:14,751 INFO L175 Difference]: Start difference. First operand has 472 places, 2734 transitions, 60370 flow. Second operand 20 states and 2342 transitions. [2023-09-01 13:46:14,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 2800 transitions, 66594 flow [2023-09-01 13:46:24,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 2800 transitions, 65912 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-09-01 13:46:24,519 INFO L231 Difference]: Finished difference. Result has 490 places, 2750 transitions, 63688 flow [2023-09-01 13:46:24,521 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-09-01 13:46:24,521 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 457 predicate places. [2023-09-01 13:46:24,521 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 2750 transitions, 63688 flow [2023-09-01 13:46:24,522 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-09-01 13:46:24,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:46:24,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:46:24,526 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-09-01 13:46:24,722 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-09-01 13:46:24,723 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-09-01 13:46:24,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:46:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1967116930, now seen corresponding path program 11 times [2023-09-01 13:46:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:46:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861741945] [2023-09-01 13:46:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:46:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:46:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:46:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:46:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:46:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861741945] [2023-09-01 13:46:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861741945] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:46:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226709583] [2023-09-01 13:46:25,684 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 13:46:25,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:46:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:46:25,684 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-09-01 13:46:25,686 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-09-01 13:46:25,789 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:46:25,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:46:25,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-01 13:46:25,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:46:26,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:46:26,137 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-09-01 13:46:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:26,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:46:26,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:46:26,266 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-09-01 13:46:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226709583] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:46:26,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:46:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2023-09-01 13:46:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164369160] [2023-09-01 13:46:26,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:46:26,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 13:46:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:46:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 13:46:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-09-01 13:46:28,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-09-01 13:46:28,999 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-09-01 13:46:28,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:46:28,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-09-01 13:46:28,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:46:40,942 INFO L130 PetriNetUnfolder]: 12473/19216 cut-off events. [2023-09-01 13:46:40,942 INFO L131 PetriNetUnfolder]: For 473242/473242 co-relation queries the response was YES. [2023-09-01 13:46:41,060 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-09-01 13:46:41,146 INFO L137 encePairwiseOnDemand]: 337/353 looper letters, 830 selfloop transitions, 1712 changer transitions 9/2551 dead transitions. [2023-09-01 13:46:41,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 2551 transitions, 63082 flow [2023-09-01 13:46:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-09-01 13:46:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-09-01 13:46:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 5943 transitions. [2023-09-01 13:46:41,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33671388101983 [2023-09-01 13:46:41,152 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 5943 transitions. [2023-09-01 13:46:41,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 5943 transitions. [2023-09-01 13:46:41,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:46:41,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 5943 transitions. [2023-09-01 13:46:41,160 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-09-01 13:46:41,169 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-09-01 13:46:41,171 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-09-01 13:46:41,171 INFO L175 Difference]: Start difference. First operand has 490 places, 2750 transitions, 63688 flow. Second operand 50 states and 5943 transitions. [2023-09-01 13:46:41,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 2551 transitions, 63082 flow [2023-09-01 13:46:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2551 transitions, 61834 flow, removed 103 selfloop flow, removed 21 redundant places. [2023-09-01 13:46:48,553 INFO L231 Difference]: Finished difference. Result has 509 places, 2401 transitions, 62267 flow [2023-09-01 13:46:48,554 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-09-01 13:46:48,555 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 476 predicate places. [2023-09-01 13:46:48,555 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 2401 transitions, 62267 flow [2023-09-01 13:46:48,555 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-09-01 13:46:48,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:46:48,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:46:48,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-09-01 13:46:48,756 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-09-01 13:46:48,756 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-09-01 13:46:48,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:46:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -625829824, now seen corresponding path program 12 times [2023-09-01 13:46:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:46:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816906716] [2023-09-01 13:46:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:46:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:46:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:46:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:46:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:46:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816906716] [2023-09-01 13:46:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816906716] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:46:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860431250] [2023-09-01 13:46:49,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 13:46:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:46:49,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:46:49,606 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-09-01 13:46:49,607 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-09-01 13:46:49,716 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 13:46:49,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:46:49,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-09-01 13:46:49,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:46:50,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:46:50,005 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-09-01 13:46:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:50,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:46:50,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:46:50,124 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-09-01 13:46:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:46:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860431250] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:46:50,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:46:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 31 [2023-09-01 13:46:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128598554] [2023-09-01 13:46:50,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:46:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 13:46:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:46:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 13:46:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2023-09-01 13:46:51,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 353 [2023-09-01 13:46:51,872 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-09-01 13:46:51,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:46:51,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 353 [2023-09-01 13:46:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:47:01,190 INFO L130 PetriNetUnfolder]: 12557/19374 cut-off events. [2023-09-01 13:47:01,190 INFO L131 PetriNetUnfolder]: For 550924/550924 co-relation queries the response was YES. [2023-09-01 13:47:01,313 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-09-01 13:47:01,416 INFO L137 encePairwiseOnDemand]: 338/353 looper letters, 1287 selfloop transitions, 1212 changer transitions 6/2505 dead transitions. [2023-09-01 13:47:01,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 2505 transitions, 69142 flow [2023-09-01 13:47:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 13:47:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 13:47:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2383 transitions. [2023-09-01 13:47:01,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33753541076487253 [2023-09-01 13:47:01,418 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2383 transitions. [2023-09-01 13:47:01,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2383 transitions. [2023-09-01 13:47:01,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:47:01,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2383 transitions. [2023-09-01 13:47:01,421 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-09-01 13:47:01,425 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-09-01 13:47:01,426 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-09-01 13:47:01,426 INFO L175 Difference]: Start difference. First operand has 509 places, 2401 transitions, 62267 flow. Second operand 20 states and 2383 transitions. [2023-09-01 13:47:01,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 2505 transitions, 69142 flow [2023-09-01 13:47:10,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 2505 transitions, 68696 flow, removed 168 selfloop flow, removed 11 redundant places. [2023-09-01 13:47:10,256 INFO L231 Difference]: Finished difference. Result has 522 places, 2454 transitions, 66979 flow [2023-09-01 13:47:10,258 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-09-01 13:47:10,258 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 489 predicate places. [2023-09-01 13:47:10,258 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 2454 transitions, 66979 flow [2023-09-01 13:47:10,259 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-09-01 13:47:10,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:47:10,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:47:10,263 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-09-01 13:47:10,460 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-09-01 13:47:10,460 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-09-01 13:47:10,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:47:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1375121970, now seen corresponding path program 13 times [2023-09-01 13:47:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:47:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307947131] [2023-09-01 13:47:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:47:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:47:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:47:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:47:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:47:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307947131] [2023-09-01 13:47:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307947131] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:47:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172535718] [2023-09-01 13:47:11,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 13:47:11,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:47:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:47:11,597 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-09-01 13:47:11,597 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-09-01 13:47:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:47:11,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-09-01 13:47:11,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:47:12,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:47:12,014 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-09-01 13:47:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:47:12,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:47:12,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:47:12,108 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-09-01 13:47:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:47:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172535718] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:47:12,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:47:12,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2023-09-01 13:47:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30935533] [2023-09-01 13:47:12,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:47:12,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-01 13:47:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:47:12,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-01 13:47:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2023-09-01 13:47:13,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 353 [2023-09-01 13:47:13,908 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-09-01 13:47:13,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:47:13,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 353 [2023-09-01 13:47:13,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:47:25,197 INFO L130 PetriNetUnfolder]: 13523/20972 cut-off events. [2023-09-01 13:47:25,198 INFO L131 PetriNetUnfolder]: For 721329/721508 co-relation queries the response was YES. [2023-09-01 13:47:25,343 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-09-01 13:47:25,554 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1653 selfloop transitions, 1149 changer transitions 1/2835 dead transitions. [2023-09-01 13:47:25,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2835 transitions, 80586 flow [2023-09-01 13:47:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-01 13:47:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-09-01 13:47:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3684 transitions. [2023-09-01 13:47:25,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34787535410764875 [2023-09-01 13:47:25,558 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3684 transitions. [2023-09-01 13:47:25,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3684 transitions. [2023-09-01 13:47:25,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:47:25,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3684 transitions. [2023-09-01 13:47:25,563 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-09-01 13:47:25,569 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-09-01 13:47:25,570 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-09-01 13:47:25,570 INFO L175 Difference]: Start difference. First operand has 522 places, 2454 transitions, 66979 flow. Second operand 30 states and 3684 transitions. [2023-09-01 13:47:25,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 2835 transitions, 80586 flow [2023-09-01 13:47:35,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 2835 transitions, 79801 flow, removed 28 selfloop flow, removed 12 redundant places. [2023-09-01 13:47:35,217 INFO L231 Difference]: Finished difference. Result has 544 places, 2668 transitions, 75354 flow [2023-09-01 13:47:35,219 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-09-01 13:47:35,220 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-09-01 13:47:35,220 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 2668 transitions, 75354 flow [2023-09-01 13:47:35,220 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-09-01 13:47:35,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:47:35,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:47:35,228 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-09-01 13:47:35,426 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-09-01 13:47:35,426 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-09-01 13:47:35,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:47:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1253047374, now seen corresponding path program 14 times [2023-09-01 13:47:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:47:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083303877] [2023-09-01 13:47:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:47:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:47:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:47:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:47:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:47:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083303877] [2023-09-01 13:47:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083303877] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:47:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048240095] [2023-09-01 13:47:36,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:47:36,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:47:36,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:47:36,062 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-09-01 13:47:36,064 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-09-01 13:47:36,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:47:36,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:47:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-01 13:47:36,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:47:36,417 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-09-01 13:47:36,418 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-09-01 13:47:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:47:36,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:47:36,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:47:36,599 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-09-01 13:47:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:47:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048240095] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:47:36,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:47:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2023-09-01 13:47:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128533786] [2023-09-01 13:47:36,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:47:36,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-01 13:47:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:47:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-01 13:47:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-09-01 13:47:37,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 353 [2023-09-01 13:47:37,856 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-09-01 13:47:37,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:47:37,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 353 [2023-09-01 13:47:37,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:47:49,650 INFO L130 PetriNetUnfolder]: 14315/22175 cut-off events. [2023-09-01 13:47:49,650 INFO L131 PetriNetUnfolder]: For 760067/760251 co-relation queries the response was YES. [2023-09-01 13:47:49,805 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-09-01 13:47:49,910 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1101 selfloop transitions, 1751 changer transitions 6/2890 dead transitions. [2023-09-01 13:47:49,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2890 transitions, 84916 flow [2023-09-01 13:47:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-01 13:47:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-09-01 13:47:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3371 transitions. [2023-09-01 13:47:49,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36729134887775117 [2023-09-01 13:47:49,913 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3371 transitions. [2023-09-01 13:47:49,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3371 transitions. [2023-09-01 13:47:49,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:47:49,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3371 transitions. [2023-09-01 13:47:49,917 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-09-01 13:47:49,922 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-09-01 13:47:49,923 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-09-01 13:47:49,923 INFO L175 Difference]: Start difference. First operand has 544 places, 2668 transitions, 75354 flow. Second operand 26 states and 3371 transitions. [2023-09-01 13:47:49,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 2890 transitions, 84916 flow [2023-09-01 13:48:00,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 2890 transitions, 84753 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-09-01 13:48:00,985 INFO L231 Difference]: Finished difference. Result has 567 places, 2767 transitions, 82041 flow [2023-09-01 13:48:00,987 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-09-01 13:48:00,987 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 534 predicate places. [2023-09-01 13:48:00,987 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 2767 transitions, 82041 flow [2023-09-01 13:48:00,988 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-09-01 13:48:00,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:48:00,988 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-09-01 13:48:00,997 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-09-01 13:48:01,195 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-09-01 13:48:01,195 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-09-01 13:48:01,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:48:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1650705045, now seen corresponding path program 15 times [2023-09-01 13:48:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:48:01,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928695333] [2023-09-01 13:48:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:48:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:48:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:48:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:48:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:48:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928695333] [2023-09-01 13:48:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928695333] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:48:01,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154173793] [2023-09-01 13:48:01,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:48:01,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:48:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:48:01,289 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-09-01 13:48:01,314 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-09-01 13:48:01,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 13:48:01,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:48:01,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 13:48:01,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:48:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:48:01,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:48:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:48:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154173793] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:48:01,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:48:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-09-01 13:48:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482342298] [2023-09-01 13:48:01,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:48:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 13:48:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:48:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 13:48:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-09-01 13:48:01,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-09-01 13:48:01,695 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-09-01 13:48:01,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:48:01,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-09-01 13:48:01,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:48:13,837 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-09-01 13:48:13,837 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 13:48:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 13:48:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 13:48:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 13:48:15,905 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-09-01 13:48:15,905 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 13:48:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 13:48:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 13:48:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 13:48:19,617 INFO L130 PetriNetUnfolder]: 20257/32768 cut-off events. [2023-09-01 13:48:19,618 INFO L131 PetriNetUnfolder]: For 1480218/1481229 co-relation queries the response was YES. [2023-09-01 13:48:19,986 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-09-01 13:48:20,282 INFO L137 encePairwiseOnDemand]: 345/353 looper letters, 3012 selfloop transitions, 546 changer transitions 68/3702 dead transitions. [2023-09-01 13:48:20,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 3702 transitions, 119734 flow [2023-09-01 13:48:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 13:48:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 13:48:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1864 transitions. [2023-09-01 13:48:20,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4400377714825307 [2023-09-01 13:48:20,284 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1864 transitions. [2023-09-01 13:48:20,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1864 transitions. [2023-09-01 13:48:20,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:48:20,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1864 transitions. [2023-09-01 13:48:20,285 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-09-01 13:48:20,287 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-09-01 13:48:20,287 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-09-01 13:48:20,287 INFO L175 Difference]: Start difference. First operand has 567 places, 2767 transitions, 82041 flow. Second operand 12 states and 1864 transitions. [2023-09-01 13:48:20,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 3702 transitions, 119734 flow [2023-09-01 13:48:44,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 3702 transitions, 118377 flow, removed 159 selfloop flow, removed 18 redundant places. [2023-09-01 13:48:44,661 INFO L231 Difference]: Finished difference. Result has 557 places, 2481 transitions, 76277 flow [2023-09-01 13:48:44,663 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-09-01 13:48:44,664 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 524 predicate places. [2023-09-01 13:48:44,664 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 2481 transitions, 76277 flow [2023-09-01 13:48:44,664 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-09-01 13:48:44,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:48:44,664 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-09-01 13:48:44,672 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-09-01 13:48:44,870 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-09-01 13:48:44,870 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-09-01 13:48:44,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:48:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 823383047, now seen corresponding path program 16 times [2023-09-01 13:48:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:48:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615638223] [2023-09-01 13:48:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:48:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:48:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:48:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:48:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:48:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615638223] [2023-09-01 13:48:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615638223] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:48:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320384903] [2023-09-01 13:48:44,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 13:48:44,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:48:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:48:44,977 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-09-01 13:48:44,978 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-09-01 13:48:45,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 13:48:45,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:48:45,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 13:48:45,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:48:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:48:45,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:48:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:48:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320384903] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:48:45,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:48:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-09-01 13:48:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246740972] [2023-09-01 13:48:45,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:48:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 13:48:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:48:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 13:48:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-09-01 13:48:45,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:48:45,642 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-09-01 13:48:45,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:48:45,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:48:45,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:49:05,443 INFO L130 PetriNetUnfolder]: 24038/38189 cut-off events. [2023-09-01 13:49:05,443 INFO L131 PetriNetUnfolder]: For 1552510/1552650 co-relation queries the response was YES. [2023-09-01 13:49:05,940 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-09-01 13:49:06,156 INFO L137 encePairwiseOnDemand]: 339/353 looper letters, 1488 selfloop transitions, 2652 changer transitions 9/4248 dead transitions. [2023-09-01 13:49:06,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 4248 transitions, 131236 flow [2023-09-01 13:49:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-01 13:49:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-09-01 13:49:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4708 transitions. [2023-09-01 13:49:06,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41678470254957506 [2023-09-01 13:49:06,159 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4708 transitions. [2023-09-01 13:49:06,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4708 transitions. [2023-09-01 13:49:06,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:49:06,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4708 transitions. [2023-09-01 13:49:06,162 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-09-01 13:49:06,166 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-09-01 13:49:06,167 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-09-01 13:49:06,167 INFO L175 Difference]: Start difference. First operand has 557 places, 2481 transitions, 76277 flow. Second operand 32 states and 4708 transitions. [2023-09-01 13:49:06,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 4248 transitions, 131236 flow [2023-09-01 13:49:31,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 4248 transitions, 127925 flow, removed 595 selfloop flow, removed 36 redundant places. [2023-09-01 13:49:31,768 INFO L231 Difference]: Finished difference. Result has 544 places, 3644 transitions, 118305 flow [2023-09-01 13:49:31,770 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-09-01 13:49:31,770 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-09-01 13:49:31,770 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 3644 transitions, 118305 flow [2023-09-01 13:49:31,771 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-09-01 13:49:31,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:49:31,771 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-09-01 13:49:31,779 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-09-01 13:49:31,979 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-09-01 13:49:31,979 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-09-01 13:49:31,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:49:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 358970001, now seen corresponding path program 1 times [2023-09-01 13:49:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:49:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732104742] [2023-09-01 13:49:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:49:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:49:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:49:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:49:32,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:49:32,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732104742] [2023-09-01 13:49:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732104742] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:49:32,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720514243] [2023-09-01 13:49:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:49:32,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:49:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:49:32,085 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-09-01 13:49:32,089 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-09-01 13:49:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:49:32,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 13:49:32,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:49:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:49:32,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:49:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:49:32,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720514243] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:49:32,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:49:32,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-09-01 13:49:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349636119] [2023-09-01 13:49:32,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:49:32,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-09-01 13:49:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:49:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-09-01 13:49:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-09-01 13:49:32,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:49:32,667 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-09-01 13:49:32,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:49:32,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:49:32,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:50:03,351 INFO L130 PetriNetUnfolder]: 27149/43154 cut-off events. [2023-09-01 13:50:03,351 INFO L131 PetriNetUnfolder]: For 2086351/2086517 co-relation queries the response was YES. [2023-09-01 13:50:03,976 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-09-01 13:50:04,199 INFO L137 encePairwiseOnDemand]: 343/353 looper letters, 3689 selfloop transitions, 1164 changer transitions 82/5034 dead transitions. [2023-09-01 13:50:04,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 5034 transitions, 167769 flow [2023-09-01 13:50:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-01 13:50:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-09-01 13:50:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3854 transitions. [2023-09-01 13:50:04,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41991719328829813 [2023-09-01 13:50:04,203 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3854 transitions. [2023-09-01 13:50:04,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3854 transitions. [2023-09-01 13:50:04,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:50:04,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3854 transitions. [2023-09-01 13:50:04,206 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-09-01 13:50:04,211 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-09-01 13:50:04,211 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-09-01 13:50:04,211 INFO L175 Difference]: Start difference. First operand has 544 places, 3644 transitions, 118305 flow. Second operand 26 states and 3854 transitions. [2023-09-01 13:50:04,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 5034 transitions, 167769 flow [2023-09-01 13:50:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 5034 transitions, 166844 flow, removed 458 selfloop flow, removed 4 redundant places. [2023-09-01 13:50:46,640 INFO L231 Difference]: Finished difference. Result has 579 places, 4094 transitions, 134332 flow [2023-09-01 13:50:46,642 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-09-01 13:50:46,643 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 546 predicate places. [2023-09-01 13:50:46,643 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 4094 transitions, 134332 flow [2023-09-01 13:50:46,643 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-09-01 13:50:46,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:50:46,643 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-09-01 13:50:46,651 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-09-01 13:50:46,844 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-09-01 13:50:46,844 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-09-01 13:50:46,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:50:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 978819407, now seen corresponding path program 17 times [2023-09-01 13:50:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:50:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976756087] [2023-09-01 13:50:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:50:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:50:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:50:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:50:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:50:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976756087] [2023-09-01 13:50:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976756087] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:50:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772823547] [2023-09-01 13:50:46,937 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 13:50:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:50:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:50:46,938 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-09-01 13:50:46,948 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-09-01 13:50:47,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:50:47,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:50:47,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 13:50:47,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:50:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:50:47,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:50:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:50:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772823547] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:50:47,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:50:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-09-01 13:50:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146351313] [2023-09-01 13:50:47,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:50:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 13:50:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:50:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 13:50:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-09-01 13:50:47,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 353 [2023-09-01 13:50:47,401 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-09-01 13:50:47,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:50:47,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 353 [2023-09-01 13:50:47,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:51:09,465 INFO L130 PetriNetUnfolder]: 16856/26602 cut-off events. [2023-09-01 13:51:09,466 INFO L131 PetriNetUnfolder]: For 1306540/1306992 co-relation queries the response was YES. [2023-09-01 13:51:09,694 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-09-01 13:51:09,814 INFO L137 encePairwiseOnDemand]: 346/353 looper letters, 2255 selfloop transitions, 230 changer transitions 1099/3645 dead transitions. [2023-09-01 13:51:09,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 3645 transitions, 122238 flow [2023-09-01 13:51:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 13:51:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 13:51:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2023-09-01 13:51:09,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43590651558073656 [2023-09-01 13:51:09,815 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1231 transitions. [2023-09-01 13:51:09,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1231 transitions. [2023-09-01 13:51:09,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:51:09,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1231 transitions. [2023-09-01 13:51:09,816 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-09-01 13:51:09,817 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-09-01 13:51:09,817 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-09-01 13:51:09,818 INFO L175 Difference]: Start difference. First operand has 579 places, 4094 transitions, 134332 flow. Second operand 8 states and 1231 transitions. [2023-09-01 13:51:09,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 3645 transitions, 122238 flow [2023-09-01 13:51:29,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 3645 transitions, 119491 flow, removed 478 selfloop flow, removed 15 redundant places. [2023-09-01 13:51:29,545 INFO L231 Difference]: Finished difference. Result has 568 places, 2332 transitions, 71897 flow [2023-09-01 13:51:29,547 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-09-01 13:51:29,547 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 535 predicate places. [2023-09-01 13:51:29,547 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 2332 transitions, 71897 flow [2023-09-01 13:51:29,548 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-09-01 13:51:29,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:51:29,548 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-09-01 13:51:29,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-09-01 13:51:29,748 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-09-01 13:51:29,751 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-09-01 13:51:29,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:51:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1527957887, now seen corresponding path program 2 times [2023-09-01 13:51:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:51:29,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875998382] [2023-09-01 13:51:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:51:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:51:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:51:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:51:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:51:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875998382] [2023-09-01 13:51:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875998382] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:51:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101864782] [2023-09-01 13:51:29,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:51:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:51:29,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:51:29,854 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-09-01 13:51:29,857 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-09-01 13:51:29,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:51:29,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:51:29,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 13:51:29,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:51:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:51:30,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:51:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:51:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101864782] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:51:30,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:51:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-09-01 13:51:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656622625] [2023-09-01 13:51:30,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:51:30,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 13:51:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:51:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 13:51:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-09-01 13:51:30,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:51:30,422 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-09-01 13:51:30,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:51:30,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:51:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:51:45,166 INFO L130 PetriNetUnfolder]: 17629/28087 cut-off events. [2023-09-01 13:51:45,166 INFO L131 PetriNetUnfolder]: For 1405878/1406052 co-relation queries the response was YES. [2023-09-01 13:51:45,415 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-09-01 13:51:45,690 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 2658 selfloop transitions, 483 changer transitions 49/3253 dead transitions. [2023-09-01 13:51:45,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 3253 transitions, 103279 flow [2023-09-01 13:51:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-01 13:51:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-09-01 13:51:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3097 transitions. [2023-09-01 13:51:45,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41777957641980307 [2023-09-01 13:51:45,693 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3097 transitions. [2023-09-01 13:51:45,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3097 transitions. [2023-09-01 13:51:45,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:51:45,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3097 transitions. [2023-09-01 13:51:45,695 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-09-01 13:51:45,698 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-09-01 13:51:45,698 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-09-01 13:51:45,698 INFO L175 Difference]: Start difference. First operand has 568 places, 2332 transitions, 71897 flow. Second operand 21 states and 3097 transitions. [2023-09-01 13:51:45,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 3253 transitions, 103279 flow [2023-09-01 13:52:00,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 3253 transitions, 100197 flow, removed 356 selfloop flow, removed 23 redundant places. [2023-09-01 13:52:00,970 INFO L231 Difference]: Finished difference. Result has 556 places, 2550 transitions, 77485 flow [2023-09-01 13:52:00,971 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-09-01 13:52:00,972 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 523 predicate places. [2023-09-01 13:52:00,972 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 2550 transitions, 77485 flow [2023-09-01 13:52:00,972 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-09-01 13:52:00,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:52:00,972 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-09-01 13:52:00,978 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-09-01 13:52:01,173 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-09-01 13:52:01,173 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-09-01 13:52:01,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:52:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -485434675, now seen corresponding path program 18 times [2023-09-01 13:52:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:52:01,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480782922] [2023-09-01 13:52:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:52:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:52:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:52:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480782922] [2023-09-01 13:52:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480782922] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:52:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032365335] [2023-09-01 13:52:01,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 13:52:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:52:01,301 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-09-01 13:52:01,308 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-09-01 13:52:01,523 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-09-01 13:52:01,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:52:01,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 13:52:01,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:52:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:01,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:52:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032365335] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:52:01,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:52:01,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-09-01 13:52:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789015668] [2023-09-01 13:52:01,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:52:01,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 13:52:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:52:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 13:52:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-09-01 13:52:01,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 353 [2023-09-01 13:52:01,998 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-09-01 13:52:01,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:52:01,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 353 [2023-09-01 13:52:01,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:52:12,954 INFO L130 PetriNetUnfolder]: 11887/19805 cut-off events. [2023-09-01 13:52:12,955 INFO L131 PetriNetUnfolder]: For 928771/929124 co-relation queries the response was YES. [2023-09-01 13:52:13,106 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-09-01 13:52:13,190 INFO L137 encePairwiseOnDemand]: 344/353 looper letters, 1654 selfloop transitions, 167 changer transitions 179/2081 dead transitions. [2023-09-01 13:52:13,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 2081 transitions, 62266 flow [2023-09-01 13:52:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 13:52:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 13:52:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1505 transitions. [2023-09-01 13:52:13,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263456090651558 [2023-09-01 13:52:13,191 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1505 transitions. [2023-09-01 13:52:13,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1505 transitions. [2023-09-01 13:52:13,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:52:13,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1505 transitions. [2023-09-01 13:52:13,193 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-09-01 13:52:13,194 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-09-01 13:52:13,194 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-09-01 13:52:13,194 INFO L175 Difference]: Start difference. First operand has 556 places, 2550 transitions, 77485 flow. Second operand 10 states and 1505 transitions. [2023-09-01 13:52:13,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 2081 transitions, 62266 flow [2023-09-01 13:52:20,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 2081 transitions, 60641 flow, removed 301 selfloop flow, removed 10 redundant places. [2023-09-01 13:52:20,572 INFO L231 Difference]: Finished difference. Result has 544 places, 1850 transitions, 51127 flow [2023-09-01 13:52:20,573 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-09-01 13:52:20,573 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 511 predicate places. [2023-09-01 13:52:20,573 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 1850 transitions, 51127 flow [2023-09-01 13:52:20,574 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-09-01 13:52:20,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:52:20,574 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-09-01 13:52:20,579 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-09-01 13:52:20,774 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-09-01 13:52:20,774 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-09-01 13:52:20,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:52:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash 955848005, now seen corresponding path program 3 times [2023-09-01 13:52:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:52:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962320807] [2023-09-01 13:52:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:52:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:52:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:52:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962320807] [2023-09-01 13:52:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962320807] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:52:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699896020] [2023-09-01 13:52:20,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:52:20,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:20,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:52:20,916 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-09-01 13:52:20,921 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-09-01 13:52:21,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 13:52:21,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:52:21,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 13:52:21,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:52:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:21,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:52:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699896020] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:52:21,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:52:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-09-01 13:52:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992923455] [2023-09-01 13:52:21,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:52:21,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 13:52:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:52:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 13:52:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-09-01 13:52:21,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:52:21,654 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-09-01 13:52:21,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:52:21,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:52:21,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:52:29,949 INFO L130 PetriNetUnfolder]: 11295/18824 cut-off events. [2023-09-01 13:52:29,949 INFO L131 PetriNetUnfolder]: For 676170/676362 co-relation queries the response was YES. [2023-09-01 13:52:30,084 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-09-01 13:52:30,168 INFO L137 encePairwiseOnDemand]: 341/353 looper letters, 1708 selfloop transitions, 470 changer transitions 106/2333 dead transitions. [2023-09-01 13:52:30,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 2333 transitions, 65367 flow [2023-09-01 13:52:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-09-01 13:52:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-09-01 13:52:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3256 transitions. [2023-09-01 13:52:30,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192634560906516 [2023-09-01 13:52:30,171 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3256 transitions. [2023-09-01 13:52:30,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3256 transitions. [2023-09-01 13:52:30,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:52:30,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3256 transitions. [2023-09-01 13:52:30,174 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-09-01 13:52:30,177 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-09-01 13:52:30,178 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-09-01 13:52:30,178 INFO L175 Difference]: Start difference. First operand has 544 places, 1850 transitions, 51127 flow. Second operand 22 states and 3256 transitions. [2023-09-01 13:52:30,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 2333 transitions, 65367 flow [2023-09-01 13:52:35,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 2333 transitions, 63972 flow, removed 229 selfloop flow, removed 30 redundant places. [2023-09-01 13:52:35,986 INFO L231 Difference]: Finished difference. Result has 527 places, 1823 transitions, 50287 flow [2023-09-01 13:52:35,988 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-09-01 13:52:35,988 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 494 predicate places. [2023-09-01 13:52:35,988 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 1823 transitions, 50287 flow [2023-09-01 13:52:35,989 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-09-01 13:52:35,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:52:35,989 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-09-01 13:52:35,996 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-09-01 13:52:36,195 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-09-01 13:52:36,198 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-09-01 13:52:36,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:52:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1680272153, now seen corresponding path program 4 times [2023-09-01 13:52:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:52:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017721742] [2023-09-01 13:52:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:52:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:52:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:52:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017721742] [2023-09-01 13:52:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017721742] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:52:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951649354] [2023-09-01 13:52:36,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 13:52:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:36,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:52:36,293 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-09-01 13:52:36,320 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-09-01 13:52:36,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 13:52:36,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:52:36,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 13:52:36,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:52:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:36,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:52:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:52:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951649354] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:52:36,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:52:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-09-01 13:52:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021210017] [2023-09-01 13:52:36,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:52:36,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 13:52:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:52:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 13:52:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-09-01 13:52:36,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:52:36,896 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-09-01 13:52:36,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:52:36,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:52:36,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:52:43,640 INFO L130 PetriNetUnfolder]: 9248/15262 cut-off events. [2023-09-01 13:52:43,641 INFO L131 PetriNetUnfolder]: For 524239/524471 co-relation queries the response was YES. [2023-09-01 13:52:43,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164401 conditions, 15262 events. 9248/15262 cut-off events. For 524239/524471 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 112183 event pairs, 1193 based on Foata normal form. 307/15560 useless extension candidates. Maximal degree in co-relation 164270. Up to 5340 conditions per place. [2023-09-01 13:52:43,801 INFO L137 encePairwiseOnDemand]: 342/353 looper letters, 1472 selfloop transitions, 314 changer transitions 133/1960 dead transitions. [2023-09-01 13:52:43,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 1960 transitions, 56262 flow [2023-09-01 13:52:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 13:52:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 13:52:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2353 transitions. [2023-09-01 13:52:43,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41660764872521244 [2023-09-01 13:52:43,803 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2353 transitions. [2023-09-01 13:52:43,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2353 transitions. [2023-09-01 13:52:43,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:52:43,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2353 transitions. [2023-09-01 13:52:43,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 147.0625) internal successors, (2353), 16 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:43,807 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-09-01 13:52:43,807 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-09-01 13:52:43,807 INFO L175 Difference]: Start difference. First operand has 527 places, 1823 transitions, 50287 flow. Second operand 16 states and 2353 transitions. [2023-09-01 13:52:43,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 1960 transitions, 56262 flow [2023-09-01 13:52:47,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 1960 transitions, 54956 flow, removed 109 selfloop flow, removed 22 redundant places. [2023-09-01 13:52:47,690 INFO L231 Difference]: Finished difference. Result has 512 places, 1594 transitions, 43703 flow [2023-09-01 13:52:47,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=43548, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=43703, PETRI_PLACES=512, PETRI_TRANSITIONS=1594} [2023-09-01 13:52:47,692 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 479 predicate places. [2023-09-01 13:52:47,692 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1594 transitions, 43703 flow [2023-09-01 13:52:47,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.83333333333334) internal successors, (2535), 18 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:47,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:52:47,693 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-09-01 13:52:47,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-09-01 13:52:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:47,898 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 13:52:47,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:52:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1224659079, now seen corresponding path program 5 times [2023-09-01 13:52:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:52:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62966839] [2023-09-01 13:52:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:52:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:52:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:52:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62966839] [2023-09-01 13:52:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62966839] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:52:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207575823] [2023-09-01 13:52:48,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 13:52:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:52:48,095 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:52:48,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-09-01 13:52:48,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:52:48,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:52:48,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 13:52:48,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:52:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:48,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:52:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:52:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207575823] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:52:48,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:52:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-09-01 13:52:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872230905] [2023-09-01 13:52:48,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:52:48,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 13:52:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:52:48,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 13:52:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-09-01 13:52:48,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:52:48,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1594 transitions, 43703 flow. Second operand has 16 states, 16 states have (on average 140.5625) internal successors, (2249), 16 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:48,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:52:48,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:52:48,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:52:52,452 INFO L130 PetriNetUnfolder]: 6345/10131 cut-off events. [2023-09-01 13:52:52,453 INFO L131 PetriNetUnfolder]: For 368886/369138 co-relation queries the response was YES. [2023-09-01 13:52:52,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113460 conditions, 10131 events. 6345/10131 cut-off events. For 368886/369138 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 65340 event pairs, 785 based on Foata normal form. 479/10603 useless extension candidates. Maximal degree in co-relation 113336. Up to 4182 conditions per place. [2023-09-01 13:52:52,558 INFO L137 encePairwiseOnDemand]: 343/353 looper letters, 1081 selfloop transitions, 94 changer transitions 190/1392 dead transitions. [2023-09-01 13:52:52,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1392 transitions, 40181 flow [2023-09-01 13:52:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 13:52:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 13:52:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1746 transitions. [2023-09-01 13:52:52,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121813031161473 [2023-09-01 13:52:52,560 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1746 transitions. [2023-09-01 13:52:52,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1746 transitions. [2023-09-01 13:52:52,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:52:52,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1746 transitions. [2023-09-01 13:52:52,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 145.5) internal successors, (1746), 12 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:52,563 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-09-01 13:52:52,563 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-09-01 13:52:52,563 INFO L175 Difference]: Start difference. First operand has 512 places, 1594 transitions, 43703 flow. Second operand 12 states and 1746 transitions. [2023-09-01 13:52:52,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1392 transitions, 40181 flow [2023-09-01 13:52:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 1392 transitions, 38776 flow, removed 170 selfloop flow, removed 48 redundant places. [2023-09-01 13:52:54,970 INFO L231 Difference]: Finished difference. Result has 430 places, 1082 transitions, 29096 flow [2023-09-01 13:52:54,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=32389, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=29096, PETRI_PLACES=430, PETRI_TRANSITIONS=1082} [2023-09-01 13:52:54,972 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 397 predicate places. [2023-09-01 13:52:54,972 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1082 transitions, 29096 flow [2023-09-01 13:52:54,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 140.5625) internal successors, (2249), 16 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:54,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:52:54,973 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:52:54,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-09-01 13:52:55,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-09-01 13:52:55,178 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 13:52:55,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:52:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1272059176, now seen corresponding path program 19 times [2023-09-01 13:52:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:52:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882959738] [2023-09-01 13:52:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:52:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:52:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:52:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:52:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882959738] [2023-09-01 13:52:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882959738] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:52:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517294383] [2023-09-01 13:52:55,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 13:52:55,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:52:55,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:52:55,462 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:52:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-09-01 13:52:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:52:55,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 13:52:55,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:52:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:52:55,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:52:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:52:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517294383] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:52:56,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:52:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-09-01 13:52:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22623535] [2023-09-01 13:52:56,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:52:56,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 13:52:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:52:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 13:52:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-09-01 13:52:56,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:52:56,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1082 transitions, 29096 flow. Second operand has 20 states, 20 states have (on average 140.75) internal successors, (2815), 20 states have internal predecessors, (2815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:52:56,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:52:56,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:52:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:53:01,336 INFO L130 PetriNetUnfolder]: 9241/14091 cut-off events. [2023-09-01 13:53:01,336 INFO L131 PetriNetUnfolder]: For 505440/505814 co-relation queries the response was YES. [2023-09-01 13:53:01,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163938 conditions, 14091 events. 9241/14091 cut-off events. For 505440/505814 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 89752 event pairs, 397 based on Foata normal form. 132/14204 useless extension candidates. Maximal degree in co-relation 163837. Up to 6508 conditions per place. [2023-09-01 13:53:01,483 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 805 selfloop transitions, 1154 changer transitions 0/1986 dead transitions. [2023-09-01 13:53:01,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1986 transitions, 55031 flow [2023-09-01 13:53:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-01 13:53:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-09-01 13:53:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4255 transitions. [2023-09-01 13:53:01,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41564911595193904 [2023-09-01 13:53:01,485 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4255 transitions. [2023-09-01 13:53:01,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4255 transitions. [2023-09-01 13:53:01,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:53:01,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4255 transitions. [2023-09-01 13:53:01,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 146.72413793103448) internal successors, (4255), 29 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:01,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 353.0) internal successors, (10590), 30 states have internal predecessors, (10590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:01,493 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 353.0) internal successors, (10590), 30 states have internal predecessors, (10590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:01,493 INFO L175 Difference]: Start difference. First operand has 430 places, 1082 transitions, 29096 flow. Second operand 29 states and 4255 transitions. [2023-09-01 13:53:01,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1986 transitions, 55031 flow [2023-09-01 13:53:04,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1986 transitions, 50286 flow, removed 348 selfloop flow, removed 26 redundant places. [2023-09-01 13:53:04,481 INFO L231 Difference]: Finished difference. Result has 358 places, 1562 transitions, 42785 flow [2023-09-01 13:53:04,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=26534, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=705, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=42785, PETRI_PLACES=358, PETRI_TRANSITIONS=1562} [2023-09-01 13:53:04,482 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 325 predicate places. [2023-09-01 13:53:04,482 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1562 transitions, 42785 flow [2023-09-01 13:53:04,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 140.75) internal successors, (2815), 20 states have internal predecessors, (2815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:04,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:53:04,483 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:53:04,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-09-01 13:53:04,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-09-01 13:53:04,684 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 13:53:04,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:53:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1741797494, now seen corresponding path program 20 times [2023-09-01 13:53:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:53:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832643070] [2023-09-01 13:53:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:53:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:53:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:53:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:53:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832643070] [2023-09-01 13:53:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832643070] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:53:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852144562] [2023-09-01 13:53:04,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:53:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:53:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:53:04,789 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:53:04,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-09-01 13:53:04,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:53:04,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:53:04,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 13:53:04,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:53:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:05,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:53:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852144562] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:53:05,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:53:05,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-09-01 13:53:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768189617] [2023-09-01 13:53:05,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:53:05,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 13:53:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:53:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 13:53:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-09-01 13:53:05,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:53:05,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1562 transitions, 42785 flow. Second operand has 20 states, 20 states have (on average 140.5) internal successors, (2810), 20 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:05,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:53:05,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:53:05,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:53:13,446 INFO L130 PetriNetUnfolder]: 13610/20685 cut-off events. [2023-09-01 13:53:13,446 INFO L131 PetriNetUnfolder]: For 708543/708947 co-relation queries the response was YES. [2023-09-01 13:53:13,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231206 conditions, 20685 events. 13610/20685 cut-off events. For 708543/708947 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 136697 event pairs, 644 based on Foata normal form. 126/20784 useless extension candidates. Maximal degree in co-relation 231106. Up to 9581 conditions per place. [2023-09-01 13:53:13,681 INFO L137 encePairwiseOnDemand]: 340/353 looper letters, 1257 selfloop transitions, 1285 changer transitions 0/2569 dead transitions. [2023-09-01 13:53:13,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2569 transitions, 69197 flow [2023-09-01 13:53:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-09-01 13:53:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-09-01 13:53:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5889 transitions. [2023-09-01 13:53:13,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41706798866855527 [2023-09-01 13:53:13,685 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 5889 transitions. [2023-09-01 13:53:13,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 5889 transitions. [2023-09-01 13:53:13,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:53:13,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 5889 transitions. [2023-09-01 13:53:13,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 147.225) internal successors, (5889), 40 states have internal predecessors, (5889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:13,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:13,699 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:13,699 INFO L175 Difference]: Start difference. First operand has 358 places, 1562 transitions, 42785 flow. Second operand 40 states and 5889 transitions. [2023-09-01 13:53:13,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 2569 transitions, 69197 flow [2023-09-01 13:53:19,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 2569 transitions, 67600 flow, removed 242 selfloop flow, removed 5 redundant places. [2023-09-01 13:53:19,859 INFO L231 Difference]: Finished difference. Result has 410 places, 1925 transitions, 56251 flow [2023-09-01 13:53:19,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=41782, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=955, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=56251, PETRI_PLACES=410, PETRI_TRANSITIONS=1925} [2023-09-01 13:53:19,860 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 377 predicate places. [2023-09-01 13:53:19,861 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1925 transitions, 56251 flow [2023-09-01 13:53:19,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 140.5) internal successors, (2810), 20 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:19,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:53:19,861 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:53:19,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-09-01 13:53:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-09-01 13:53:20,067 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 13:53:20,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:53:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash -720657816, now seen corresponding path program 21 times [2023-09-01 13:53:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:53:20,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67159334] [2023-09-01 13:53:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:53:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:53:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:53:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:53:20,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67159334] [2023-09-01 13:53:20,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67159334] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:53:20,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697660304] [2023-09-01 13:53:20,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 13:53:20,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:53:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:53:20,185 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:53:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-09-01 13:53:20,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 13:53:20,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:53:20,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 13:53:20,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:53:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:20,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:53:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:53:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697660304] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:53:20,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:53:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-09-01 13:53:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440949989] [2023-09-01 13:53:20,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:53:20,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 13:53:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:53:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 13:53:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-09-01 13:53:20,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 353 [2023-09-01 13:53:20,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1925 transitions, 56251 flow. Second operand has 18 states, 18 states have (on average 140.77777777777777) internal successors, (2534), 18 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:53:20,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:53:20,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 353 [2023-09-01 13:53:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15