./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.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 c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 19:56:09,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 19:56:09,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 19:56:10,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 19:56:10,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 19:56:10,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 19:56:10,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 19:56:10,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 19:56:10,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 19:56:10,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 19:56:10,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 19:56:10,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 19:56:10,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 19:56:10,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 19:56:10,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 19:56:10,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 19:56:10,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 19:56:10,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 19:56:10,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 19:56:10,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 19:56:10,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 19:56:10,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 19:56:10,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 19:56:10,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 19:56:10,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 19:56:10,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 19:56:10,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 19:56:10,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 19:56:10,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 19:56:10,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 19:56:10,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 19:56:10,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 19:56:10,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 19:56:10,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 19:56:10,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 19:56:10,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 19:56:10,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 19:56:10,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 19:56:10,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 19:56:10,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 19:56:10,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 19:56:10,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 19:56:10,090 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 19:56:10,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 19:56:10,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 19:56:10,091 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 19:56:10,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 19:56:10,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 19:56:10,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 19:56:10,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 19:56:10,093 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 19:56:10,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 19:56:10,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 19:56:10,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 19:56:10,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 19:56:10,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 19:56:10,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 19:56:10,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 19:56:10,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 19:56:10,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 19:56:10,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 19:56:10,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 19:56:10,097 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 19:56:10,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 19:56:10,097 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 19:56:10,097 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 -> c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 19:56:10,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 19:56:10,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 19:56:10,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 19:56:10,397 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 19:56:10,398 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 19:56:10,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-08-30 19:56:11,365 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 19:56:11,559 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 19:56:11,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-08-30 19:56:11,567 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13f5f865/5e118813c3e94af082ade9410a02ab68/FLAGd53a9bff0 [2023-08-30 19:56:11,580 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13f5f865/5e118813c3e94af082ade9410a02ab68 [2023-08-30 19:56:11,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 19:56:11,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 19:56:11,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 19:56:11,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 19:56:11,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 19:56:11,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbbc60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11, skipping insertion in model container [2023-08-30 19:56:11,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 19:56:11,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 19:56:11,766 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-08-30 19:56:11,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 19:56:11,784 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 19:56:11,817 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-08-30 19:56:11,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 19:56:11,834 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 19:56:11,835 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 19:56:11,839 INFO L208 MainTranslator]: Completed translation [2023-08-30 19:56:11,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11 WrapperNode [2023-08-30 19:56:11,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 19:56:11,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 19:56:11,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 19:56:11,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 19:56:11,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,899 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 326 [2023-08-30 19:56:11,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 19:56:11,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 19:56:11,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 19:56:11,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 19:56:11,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 19:56:11,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 19:56:11,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 19:56:11,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 19:56:11,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (1/1) ... [2023-08-30 19:56:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 19:56:11,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:56:11,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 19:56:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 19:56:12,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 19:56:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 19:56:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 19:56:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 19:56:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 19:56:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 19:56:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 19:56:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 19:56:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 19:56:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 19:56:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 19:56:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 19:56:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 19:56:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 19:56:12,030 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 19:56:12,198 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 19:56:12,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 19:56:12,519 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 19:56:12,670 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 19:56:12,670 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-30 19:56:12,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:56:12 BoogieIcfgContainer [2023-08-30 19:56:12,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 19:56:12,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 19:56:12,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 19:56:12,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 19:56:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 07:56:11" (1/3) ... [2023-08-30 19:56:12,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae227c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:56:12, skipping insertion in model container [2023-08-30 19:56:12,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:56:11" (2/3) ... [2023-08-30 19:56:12,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae227c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:56:12, skipping insertion in model container [2023-08-30 19:56:12,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:56:12" (3/3) ... [2023-08-30 19:56:12,680 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2023-08-30 19:56:12,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 19:56:12,690 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 19:56:12,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 19:56:12,691 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 19:56:12,742 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 19:56:12,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 237 transitions, 506 flow [2023-08-30 19:56:12,839 INFO L130 PetriNetUnfolder]: 19/233 cut-off events. [2023-08-30 19:56:12,839 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 19:56:12,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 233 events. 19/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2023-08-30 19:56:12,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 237 transitions, 506 flow [2023-08-30 19:56:12,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 221 transitions, 466 flow [2023-08-30 19:56:12,849 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 19:56:12,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 221 transitions, 466 flow [2023-08-30 19:56:12,856 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 221 transitions, 466 flow [2023-08-30 19:56:12,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 221 transitions, 466 flow [2023-08-30 19:56:12,882 INFO L130 PetriNetUnfolder]: 19/221 cut-off events. [2023-08-30 19:56:12,883 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 19:56:12,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 221 events. 19/221 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2023-08-30 19:56:12,885 INFO L119 LiptonReduction]: Number of co-enabled transitions 1824 [2023-08-30 19:56:19,478 INFO L134 LiptonReduction]: Checked pairs total: 3053 [2023-08-30 19:56:19,479 INFO L136 LiptonReduction]: Total number of compositions: 224 [2023-08-30 19:56:19,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 19:56:19,492 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;@77ed9e5a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 19:56:19,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 19:56:19,497 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2023-08-30 19:56:19,497 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 19:56:19,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:19,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 19:56:19,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 19:56:19,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1951107260, now seen corresponding path program 1 times [2023-08-30 19:56:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487849489] [2023-08-30 19:56:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:19,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487849489] [2023-08-30 19:56:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487849489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:56:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:56:20,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 19:56:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650796012] [2023-08-30 19:56:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:56:20,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 19:56:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:20,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 19:56:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 19:56:20,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 461 [2023-08-30 19:56:20,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:56:20,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 461 [2023-08-30 19:56:20,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:56:20,512 INFO L130 PetriNetUnfolder]: 2301/3039 cut-off events. [2023-08-30 19:56:20,512 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-08-30 19:56:20,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6283 conditions, 3039 events. 2301/3039 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12571 event pairs, 289 based on Foata normal form. 0/2055 useless extension candidates. Maximal degree in co-relation 4714. Up to 1372 conditions per place. [2023-08-30 19:56:20,527 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 64 selfloop transitions, 6 changer transitions 9/83 dead transitions. [2023-08-30 19:56:20,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 381 flow [2023-08-30 19:56:20,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 19:56:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 19:56:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1311 transitions. [2023-08-30 19:56:20,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47396963123644253 [2023-08-30 19:56:20,542 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1311 transitions. [2023-08-30 19:56:20,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1311 transitions. [2023-08-30 19:56:20,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:56:20,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1311 transitions. [2023-08-30 19:56:20,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,556 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,557 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 6 states and 1311 transitions. [2023-08-30 19:56:20,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 381 flow [2023-08-30 19:56:20,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 83 transitions, 343 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 19:56:20,564 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 117 flow [2023-08-30 19:56:20,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-08-30 19:56:20,597 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-30 19:56:20,597 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 117 flow [2023-08-30 19:56:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:20,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 19:56:20,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 19:56:20,599 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 2 more)] === [2023-08-30 19:56:20,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1771403961, now seen corresponding path program 1 times [2023-08-30 19:56:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336896166] [2023-08-30 19:56:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:20,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:20,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336896166] [2023-08-30 19:56:20,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336896166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:56:20,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:56:20,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 19:56:20,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173604854] [2023-08-30 19:56:20,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:56:20,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 19:56:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 19:56:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 19:56:20,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 461 [2023-08-30 19:56:20,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:56:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 461 [2023-08-30 19:56:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:56:21,024 INFO L130 PetriNetUnfolder]: 2170/3051 cut-off events. [2023-08-30 19:56:21,024 INFO L131 PetriNetUnfolder]: For 1623/1884 co-relation queries the response was YES. [2023-08-30 19:56:21,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 3051 events. 2170/3051 cut-off events. For 1623/1884 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14740 event pairs, 1340 based on Foata normal form. 514/2867 useless extension candidates. Maximal degree in co-relation 4328. Up to 2387 conditions per place. [2023-08-30 19:56:21,038 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 30 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2023-08-30 19:56:21,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 357 flow [2023-08-30 19:56:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 19:56:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 19:56:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1078 transitions. [2023-08-30 19:56:21,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46767895878524945 [2023-08-30 19:56:21,041 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1078 transitions. [2023-08-30 19:56:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1078 transitions. [2023-08-30 19:56:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:56:21,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1078 transitions. [2023-08-30 19:56:21,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 215.6) internal successors, (1078), 5 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:21,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:21,047 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:21,047 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 117 flow. Second operand 5 states and 1078 transitions. [2023-08-30 19:56:21,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 357 flow [2023-08-30 19:56:21,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 19:56:21,052 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 138 flow [2023-08-30 19:56:21,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-30 19:56:21,053 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-30 19:56:21,053 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 138 flow [2023-08-30 19:56:21,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:21,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:21,054 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, 1] [2023-08-30 19:56:21,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 19:56:21,054 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 2 more)] === [2023-08-30 19:56:21,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -901328342, now seen corresponding path program 1 times [2023-08-30 19:56:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031956122] [2023-08-30 19:56:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 19:56:21,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:21,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031956122] [2023-08-30 19:56:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031956122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:56:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091419608] [2023-08-30 19:56:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:56:21,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:56:21,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 19:56:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:21,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 19:56:21,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:56:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 19:56:21,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:56:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 19:56:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091419608] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 19:56:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 19:56:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2023-08-30 19:56:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358877282] [2023-08-30 19:56:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:56:21,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 19:56:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:21,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 19:56:21,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-08-30 19:56:21,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 461 [2023-08-30 19:56:21,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:21,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:56:21,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 461 [2023-08-30 19:56:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:56:22,197 INFO L130 PetriNetUnfolder]: 3646/4816 cut-off events. [2023-08-30 19:56:22,197 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2023-08-30 19:56:22,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12336 conditions, 4816 events. 3646/4816 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22465 event pairs, 115 based on Foata normal form. 72/3874 useless extension candidates. Maximal degree in co-relation 12320. Up to 1399 conditions per place. [2023-08-30 19:56:22,216 INFO L137 encePairwiseOnDemand]: 453/461 looper letters, 90 selfloop transitions, 15 changer transitions 0/108 dead transitions. [2023-08-30 19:56:22,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 544 flow [2023-08-30 19:56:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 19:56:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 19:56:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1472 transitions. [2023-08-30 19:56:22,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45615122404710257 [2023-08-30 19:56:22,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1472 transitions. [2023-08-30 19:56:22,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1472 transitions. [2023-08-30 19:56:22,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:56:22,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1472 transitions. [2023-08-30 19:56:22,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 210.28571428571428) internal successors, (1472), 7 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:22,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 461.0) internal successors, (3688), 8 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:22,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 461.0) internal successors, (3688), 8 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:22,227 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 138 flow. Second operand 7 states and 1472 transitions. [2023-08-30 19:56:22,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 544 flow [2023-08-30 19:56:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 522 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 19:56:22,232 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 232 flow [2023-08-30 19:56:22,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-30 19:56:22,233 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-30 19:56:22,233 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 232 flow [2023-08-30 19:56:22,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:22,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:22,234 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, 1, 1, 1] [2023-08-30 19:56:22,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 19:56:22,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:22,438 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 2 more)] === [2023-08-30 19:56:22,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 639416502, now seen corresponding path program 1 times [2023-08-30 19:56:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:22,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926644924] [2023-08-30 19:56:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926644924] [2023-08-30 19:56:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926644924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:56:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936210171] [2023-08-30 19:56:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:23,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:56:23,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:56:23,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 19:56:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:23,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-30 19:56:23,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:56:23,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:23,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:23,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:23,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 19:56:23,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 19:56:23,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:56:23,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:56:23,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:56:23,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:56:23,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-30 19:56:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:23,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:56:24,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:56:24,371 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 73 treesize of output 61 [2023-08-30 19:56:24,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5131 treesize of output 5003 [2023-08-30 19:56:24,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 275 [2023-08-30 19:56:24,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 263 [2023-08-30 19:56:24,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 215 [2023-08-30 19:56:24,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 213 [2023-08-30 19:56:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936210171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:56:24,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:56:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 28 [2023-08-30 19:56:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325745584] [2023-08-30 19:56:24,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:56:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 19:56:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:24,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 19:56:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=699, Unknown=10, NotChecked=0, Total=870 [2023-08-30 19:56:26,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:27,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 461 [2023-08-30 19:56:27,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 232 flow. Second operand has 30 states, 30 states have (on average 140.36666666666667) internal successors, (4211), 30 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:27,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:56:27,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 461 [2023-08-30 19:56:27,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:56:31,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:33,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:35,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:39,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:43,266 INFO L130 PetriNetUnfolder]: 14435/19073 cut-off events. [2023-08-30 19:56:43,266 INFO L131 PetriNetUnfolder]: For 20225/20225 co-relation queries the response was YES. [2023-08-30 19:56:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53087 conditions, 19073 events. 14435/19073 cut-off events. For 20225/20225 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 100504 event pairs, 1287 based on Foata normal form. 164/14694 useless extension candidates. Maximal degree in co-relation 25783. Up to 5758 conditions per place. [2023-08-30 19:56:43,338 INFO L137 encePairwiseOnDemand]: 446/461 looper letters, 290 selfloop transitions, 112 changer transitions 35/440 dead transitions. [2023-08-30 19:56:43,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 440 transitions, 2637 flow [2023-08-30 19:56:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-30 19:56:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-30 19:56:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4949 transitions. [2023-08-30 19:56:43,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3253138762900151 [2023-08-30 19:56:43,347 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4949 transitions. [2023-08-30 19:56:43,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4949 transitions. [2023-08-30 19:56:43,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:56:43,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4949 transitions. [2023-08-30 19:56:43,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 149.96969696969697) internal successors, (4949), 33 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:43,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 461.0) internal successors, (15674), 34 states have internal predecessors, (15674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:43,421 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 461.0) internal successors, (15674), 34 states have internal predecessors, (15674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:43,421 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 232 flow. Second operand 33 states and 4949 transitions. [2023-08-30 19:56:43,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 440 transitions, 2637 flow [2023-08-30 19:56:43,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 440 transitions, 2542 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-30 19:56:43,493 INFO L231 Difference]: Finished difference. Result has 101 places, 162 transitions, 1276 flow [2023-08-30 19:56:43,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1276, PETRI_PLACES=101, PETRI_TRANSITIONS=162} [2023-08-30 19:56:43,494 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-08-30 19:56:43,494 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 162 transitions, 1276 flow [2023-08-30 19:56:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 140.36666666666667) internal successors, (4211), 30 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:43,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:43,496 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, 1, 1, 1, 1, 1] [2023-08-30 19:56:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 19:56:43,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-30 19:56:43,699 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 2 more)] === [2023-08-30 19:56:43,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 956194251, now seen corresponding path program 2 times [2023-08-30 19:56:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:43,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526197407] [2023-08-30 19:56:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:43,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526197407] [2023-08-30 19:56:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526197407] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:56:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515155133] [2023-08-30 19:56:44,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 19:56:44,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:44,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:56:44,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:56:44,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 19:56:45,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 19:56:45,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:56:45,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 19:56:45,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:56:45,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:45,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-30 19:56:45,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-30 19:56:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:56:45,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:56:45,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:56:45,365 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 45 treesize of output 37 [2023-08-30 19:56:45,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-08-30 19:56:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:56:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515155133] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:56:45,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:56:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2023-08-30 19:56:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306129480] [2023-08-30 19:56:45,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:56:45,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 19:56:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 19:56:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=355, Unknown=6, NotChecked=0, Total=420 [2023-08-30 19:56:46,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 461 [2023-08-30 19:56:46,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 162 transitions, 1276 flow. Second operand has 21 states, 21 states have (on average 159.47619047619048) internal successors, (3349), 21 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:46,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:56:46,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 461 [2023-08-30 19:56:46,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:56:49,588 INFO L130 PetriNetUnfolder]: 18751/25061 cut-off events. [2023-08-30 19:56:49,589 INFO L131 PetriNetUnfolder]: For 65533/66386 co-relation queries the response was YES. [2023-08-30 19:56:49,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85616 conditions, 25061 events. 18751/25061 cut-off events. For 65533/66386 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 141015 event pairs, 2264 based on Foata normal form. 960/22440 useless extension candidates. Maximal degree in co-relation 80787. Up to 12821 conditions per place. [2023-08-30 19:56:49,723 INFO L137 encePairwiseOnDemand]: 451/461 looper letters, 199 selfloop transitions, 103 changer transitions 9/320 dead transitions. [2023-08-30 19:56:49,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 320 transitions, 2817 flow [2023-08-30 19:56:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 19:56:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 19:56:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2184 transitions. [2023-08-30 19:56:49,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3644251626898048 [2023-08-30 19:56:49,730 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2184 transitions. [2023-08-30 19:56:49,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2184 transitions. [2023-08-30 19:56:49,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:56:49,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2184 transitions. [2023-08-30 19:56:49,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 168.0) internal successors, (2184), 13 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:49,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:49,740 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:49,740 INFO L175 Difference]: Start difference. First operand has 101 places, 162 transitions, 1276 flow. Second operand 13 states and 2184 transitions. [2023-08-30 19:56:49,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 320 transitions, 2817 flow [2023-08-30 19:56:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 320 transitions, 2727 flow, removed 44 selfloop flow, removed 1 redundant places. [2023-08-30 19:56:50,049 INFO L231 Difference]: Finished difference. Result has 117 places, 214 transitions, 1984 flow [2023-08-30 19:56:50,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1984, PETRI_PLACES=117, PETRI_TRANSITIONS=214} [2023-08-30 19:56:50,049 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2023-08-30 19:56:50,050 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 214 transitions, 1984 flow [2023-08-30 19:56:50,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 159.47619047619048) internal successors, (3349), 21 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:56:50,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:56:50,051 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, 1, 1, 1, 1, 1] [2023-08-30 19:56:50,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 19:56:50,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:50,257 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 2 more)] === [2023-08-30 19:56:50,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:56:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1070507405, now seen corresponding path program 3 times [2023-08-30 19:56:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:56:50,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685160470] [2023-08-30 19:56:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:56:50,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:56:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:56:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:56:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:56:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685160470] [2023-08-30 19:56:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685160470] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:56:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294228718] [2023-08-30 19:56:51,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 19:56:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:56:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:56:51,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:56:51,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 19:56:51,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 19:56:51,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:56:51,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 19:56:51,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:56:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:51,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-30 19:56:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:56:51,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-30 19:56:51,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-30 19:56:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 19:56:51,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:56:53,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:56:53,983 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 87 treesize of output 79 [2023-08-30 19:56:53,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2023-08-30 19:56:53,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-08-30 19:56:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:56:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294228718] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:56:54,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:56:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-08-30 19:56:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506474004] [2023-08-30 19:56:54,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:56:54,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 19:56:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:56:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 19:56:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=427, Unknown=9, NotChecked=0, Total=506 [2023-08-30 19:56:56,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:56:58,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:57:01,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:57:01,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 461 [2023-08-30 19:57:01,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 214 transitions, 1984 flow. Second operand has 23 states, 23 states have (on average 154.2173913043478) internal successors, (3547), 23 states have internal predecessors, (3547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:01,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:57:01,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 461 [2023-08-30 19:57:01,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:57:05,132 INFO L130 PetriNetUnfolder]: 24396/32369 cut-off events. [2023-08-30 19:57:05,133 INFO L131 PetriNetUnfolder]: For 107557/107599 co-relation queries the response was YES. [2023-08-30 19:57:05,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119103 conditions, 32369 events. 24396/32369 cut-off events. For 107557/107599 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 187141 event pairs, 4108 based on Foata normal form. 3/27858 useless extension candidates. Maximal degree in co-relation 114802. Up to 13115 conditions per place. [2023-08-30 19:57:05,296 INFO L137 encePairwiseOnDemand]: 452/461 looper letters, 212 selfloop transitions, 123 changer transitions 11/351 dead transitions. [2023-08-30 19:57:05,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 351 transitions, 3503 flow [2023-08-30 19:57:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 19:57:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 19:57:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2110 transitions. [2023-08-30 19:57:05,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35207742366093775 [2023-08-30 19:57:05,305 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2110 transitions. [2023-08-30 19:57:05,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2110 transitions. [2023-08-30 19:57:05,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:57:05,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2110 transitions. [2023-08-30 19:57:05,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 162.30769230769232) internal successors, (2110), 13 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:05,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:05,318 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:05,318 INFO L175 Difference]: Start difference. First operand has 117 places, 214 transitions, 1984 flow. Second operand 13 states and 2110 transitions. [2023-08-30 19:57:05,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 351 transitions, 3503 flow [2023-08-30 19:57:06,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 351 transitions, 3459 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 19:57:06,105 INFO L231 Difference]: Finished difference. Result has 127 places, 238 transitions, 2484 flow [2023-08-30 19:57:06,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2484, PETRI_PLACES=127, PETRI_TRANSITIONS=238} [2023-08-30 19:57:06,106 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2023-08-30 19:57:06,106 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 238 transitions, 2484 flow [2023-08-30 19:57:06,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.2173913043478) internal successors, (3547), 23 states have internal predecessors, (3547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:06,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:57:06,107 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, 1, 1, 1, 1, 1] [2023-08-30 19:57:06,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 19:57:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:57:06,312 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 2 more)] === [2023-08-30 19:57:06,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:57:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1421357483, now seen corresponding path program 4 times [2023-08-30 19:57:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:57:06,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960496730] [2023-08-30 19:57:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:57:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:57:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:57:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:57:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:57:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960496730] [2023-08-30 19:57:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960496730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:57:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635639517] [2023-08-30 19:57:07,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 19:57:07,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:57:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:57:07,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:57:07,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 19:57:07,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 19:57:07,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:57:07,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-30 19:57:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:57:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:57:07,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2023-08-30 19:57:07,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 19:57:07,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 19:57:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:57:07,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 19:57:08,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-30 19:57:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:57:08,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:57:10,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 19:57:10,655 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 171 treesize of output 159 [2023-08-30 19:57:10,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2023-08-30 19:57:10,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 116 [2023-08-30 19:57:10,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2023-08-30 19:57:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:57:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635639517] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:57:11,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:57:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2023-08-30 19:57:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428617775] [2023-08-30 19:57:11,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:57:11,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 19:57:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:57:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 19:57:11,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1073, Unknown=4, NotChecked=0, Total=1260 [2023-08-30 19:57:12,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 461 [2023-08-30 19:57:12,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 238 transitions, 2484 flow. Second operand has 36 states, 36 states have (on average 143.05555555555554) internal successors, (5150), 36 states have internal predecessors, (5150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:12,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:57:12,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 461 [2023-08-30 19:57:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:57:19,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:57:33,996 INFO L130 PetriNetUnfolder]: 67944/89860 cut-off events. [2023-08-30 19:57:33,996 INFO L131 PetriNetUnfolder]: For 324109/324236 co-relation queries the response was YES. [2023-08-30 19:57:34,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347612 conditions, 89860 events. 67944/89860 cut-off events. For 324109/324236 co-relation queries the response was YES. Maximal size of possible extension queue 4339. Compared 582627 event pairs, 4681 based on Foata normal form. 416/77738 useless extension candidates. Maximal degree in co-relation 342164. Up to 16235 conditions per place. [2023-08-30 19:57:34,650 INFO L137 encePairwiseOnDemand]: 447/461 looper letters, 661 selfloop transitions, 539 changer transitions 33/1236 dead transitions. [2023-08-30 19:57:34,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1236 transitions, 11648 flow [2023-08-30 19:57:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-30 19:57:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-30 19:57:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 8527 transitions. [2023-08-30 19:57:34,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3363044764346283 [2023-08-30 19:57:34,664 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 8527 transitions. [2023-08-30 19:57:34,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 8527 transitions. [2023-08-30 19:57:34,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:57:34,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 8527 transitions. [2023-08-30 19:57:34,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 155.03636363636363) internal successors, (8527), 55 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:34,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 461.0) internal successors, (25816), 56 states have internal predecessors, (25816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:34,699 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 461.0) internal successors, (25816), 56 states have internal predecessors, (25816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:34,699 INFO L175 Difference]: Start difference. First operand has 127 places, 238 transitions, 2484 flow. Second operand 55 states and 8527 transitions. [2023-08-30 19:57:34,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1236 transitions, 11648 flow [2023-08-30 19:57:38,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1236 transitions, 11365 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-30 19:57:38,973 INFO L231 Difference]: Finished difference. Result has 198 places, 656 transitions, 8900 flow [2023-08-30 19:57:38,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=8900, PETRI_PLACES=198, PETRI_TRANSITIONS=656} [2023-08-30 19:57:38,974 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2023-08-30 19:57:38,975 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 656 transitions, 8900 flow [2023-08-30 19:57:38,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 143.05555555555554) internal successors, (5150), 36 states have internal predecessors, (5150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:38,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:57:38,976 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, 1, 1, 1, 1, 1] [2023-08-30 19:57:38,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 19:57:39,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:57:39,193 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 2 more)] === [2023-08-30 19:57:39,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:57:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash 110372441, now seen corresponding path program 1 times [2023-08-30 19:57:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:57:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514239451] [2023-08-30 19:57:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:57:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:57:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:57:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:57:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:57:39,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514239451] [2023-08-30 19:57:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514239451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:57:39,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:57:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 19:57:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40354873] [2023-08-30 19:57:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:57:39,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 19:57:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:57:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 19:57:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 19:57:39,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 461 [2023-08-30 19:57:39,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 656 transitions, 8900 flow. Second operand has 4 states, 4 states have (on average 207.75) internal successors, (831), 4 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:39,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:57:39,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 461 [2023-08-30 19:57:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:57:54,450 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_63) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (not (= (ite (and (<= 0 v_~q2_front~0_63) (< v_~q2_front~0_63 v_~q2_back~0_69) (< v_~q2_front~0_63 v_~n2~0_24)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= v_~q2_front~0_62 (+ v_~q2_front~0_63 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= (select (select |v_#memory_int_101| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* 4 v_~q2_front~0_63))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_63, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_62, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_35, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][341], [1515#true, 118#L95true, Black: 1172#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 941#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 939#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 935#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 40#L145-2true, Black: 747#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 769#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), 1175#true, Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 687#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))))), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 622#(or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 455#(<= 1 ~total~0), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 685#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1434#(and (or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1336#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1482#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1186#(<= 1 ~total~0), 448#true, Black: 1426#(and (= ~total~0 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 1472#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1486#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1468#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1430#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< 0 ~C~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1184#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1460#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1462#(and (<= 1 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1452#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1470#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1185#(or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1440#(and (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1424#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1448#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1319#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 719#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-08-30 19:57:54,451 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 19:57:54,451 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 19:57:54,451 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 19:57:54,451 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 19:57:54,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_63) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (not (= (ite (and (<= 0 v_~q2_front~0_63) (< v_~q2_front~0_63 v_~q2_back~0_69) (< v_~q2_front~0_63 v_~n2~0_24)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= v_~q2_front~0_62 (+ v_~q2_front~0_63 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= (select (select |v_#memory_int_101| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* 4 v_~q2_front~0_63))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_63, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_62, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_35, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][341], [1515#true, 118#L95true, Black: 1172#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 941#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 939#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 935#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 747#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 769#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), 1175#true, Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 687#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), 111#L146-1true, Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))))), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 622#(or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 455#(<= 1 ~total~0), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 685#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1434#(and (or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1336#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1482#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), 448#true, Black: 1186#(<= 1 ~total~0), Black: 1426#(and (= ~total~0 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 1472#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1486#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1468#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1430#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< 0 ~C~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1184#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1460#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1462#(and (<= 1 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1452#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1470#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1185#(or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1440#(and (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1424#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1448#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1319#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 719#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-08-30 19:57:54,453 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 19:57:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 19:57:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 19:57:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 19:57:54,613 INFO L130 PetriNetUnfolder]: 64327/90793 cut-off events. [2023-08-30 19:57:54,614 INFO L131 PetriNetUnfolder]: For 792567/799363 co-relation queries the response was YES. [2023-08-30 19:57:55,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409163 conditions, 90793 events. 64327/90793 cut-off events. For 792567/799363 co-relation queries the response was YES. Maximal size of possible extension queue 4933. Compared 689115 event pairs, 34662 based on Foata normal form. 5973/86460 useless extension candidates. Maximal degree in co-relation 407882. Up to 59946 conditions per place. [2023-08-30 19:57:55,829 INFO L137 encePairwiseOnDemand]: 456/461 looper letters, 653 selfloop transitions, 14 changer transitions 74/811 dead transitions. [2023-08-30 19:57:55,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 811 transitions, 12837 flow [2023-08-30 19:57:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 19:57:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 19:57:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 859 transitions. [2023-08-30 19:57:55,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658351409978308 [2023-08-30 19:57:55,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 859 transitions. [2023-08-30 19:57:55,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 859 transitions. [2023-08-30 19:57:55,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:57:55,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 859 transitions. [2023-08-30 19:57:55,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:55,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:55,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:57:55,834 INFO L175 Difference]: Start difference. First operand has 198 places, 656 transitions, 8900 flow. Second operand 4 states and 859 transitions. [2023-08-30 19:57:55,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 811 transitions, 12837 flow [2023-08-30 19:58:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 811 transitions, 11382 flow, removed 690 selfloop flow, removed 10 redundant places. [2023-08-30 19:58:16,154 INFO L231 Difference]: Finished difference. Result has 193 places, 601 transitions, 7639 flow [2023-08-30 19:58:16,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=7390, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7639, PETRI_PLACES=193, PETRI_TRANSITIONS=601} [2023-08-30 19:58:16,157 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2023-08-30 19:58:16,157 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 601 transitions, 7639 flow [2023-08-30 19:58:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.75) internal successors, (831), 4 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:58:16,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:58:16,162 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1] [2023-08-30 19:58:16,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 19:58:16,162 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 2 more)] === [2023-08-30 19:58:16,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:58:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 35460421, now seen corresponding path program 5 times [2023-08-30 19:58:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:58:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697271590] [2023-08-30 19:58:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:58:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:58:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:58:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 19:58:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:58:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697271590] [2023-08-30 19:58:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697271590] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:58:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361317739] [2023-08-30 19:58:16,415 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 19:58:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:58:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:58:16,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 19:58:16,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 19:58:16,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 19:58:16,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:58:16,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 19:58:16,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:58:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 19:58:16,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:58:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 19:58:16,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361317739] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:58:16,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:58:16,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-08-30 19:58:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479918702] [2023-08-30 19:58:16,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:58:16,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 19:58:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:58:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 19:58:16,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-08-30 19:58:16,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 461 [2023-08-30 19:58:16,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 601 transitions, 7639 flow. Second operand has 15 states, 15 states have (on average 203.93333333333334) internal successors, (3059), 15 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:58:16,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:58:16,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 461 [2023-08-30 19:58:16,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:58:38,521 INFO L130 PetriNetUnfolder]: 102971/139482 cut-off events. [2023-08-30 19:58:38,521 INFO L131 PetriNetUnfolder]: For 819488/819550 co-relation queries the response was YES. [2023-08-30 19:58:39,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607523 conditions, 139482 events. 102971/139482 cut-off events. For 819488/819550 co-relation queries the response was YES. Maximal size of possible extension queue 6808. Compared 1011506 event pairs, 6372 based on Foata normal form. 2798/142070 useless extension candidates. Maximal degree in co-relation 607463. Up to 22153 conditions per place. [2023-08-30 19:58:40,280 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 753 selfloop transitions, 456 changer transitions 5/1218 dead transitions. [2023-08-30 19:58:40,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1218 transitions, 16381 flow [2023-08-30 19:58:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 19:58:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 19:58:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4294 transitions. [2023-08-30 19:58:40,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46572668112798266 [2023-08-30 19:58:40,304 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4294 transitions. [2023-08-30 19:58:40,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4294 transitions. [2023-08-30 19:58:40,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:58:40,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4294 transitions. [2023-08-30 19:58:40,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 214.7) internal successors, (4294), 20 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:58:40,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 461.0) internal successors, (9681), 21 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:58:40,323 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 461.0) internal successors, (9681), 21 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:58:40,323 INFO L175 Difference]: Start difference. First operand has 193 places, 601 transitions, 7639 flow. Second operand 20 states and 4294 transitions. [2023-08-30 19:58:40,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1218 transitions, 16381 flow [2023-08-30 19:59:21,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1218 transitions, 16201 flow, removed 83 selfloop flow, removed 6 redundant places. [2023-08-30 19:59:21,178 INFO L231 Difference]: Finished difference. Result has 212 places, 751 transitions, 11359 flow [2023-08-30 19:59:21,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=7068, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11359, PETRI_PLACES=212, PETRI_TRANSITIONS=751} [2023-08-30 19:59:21,180 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2023-08-30 19:59:21,180 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 751 transitions, 11359 flow [2023-08-30 19:59:21,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 203.93333333333334) internal successors, (3059), 15 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:59:21,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:59:21,184 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, 1, 1, 1, 1, 1, 1] [2023-08-30 19:59:21,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-30 19:59:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:59:21,390 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 2 more)] === [2023-08-30 19:59:21,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:59:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 481211615, now seen corresponding path program 1 times [2023-08-30 19:59:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:59:21,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662920833] [2023-08-30 19:59:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:59:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:59:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:59:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 19:59:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:59:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662920833] [2023-08-30 19:59:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662920833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:59:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:59:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 19:59:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343220553] [2023-08-30 19:59:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:59:21,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 19:59:21,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:59:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 19:59:21,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 19:59:21,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 461 [2023-08-30 19:59:21,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 751 transitions, 11359 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:59:21,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:59:21,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 461 [2023-08-30 19:59:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:59:43,420 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_63) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (not (= (ite (and (<= 0 v_~q2_front~0_63) (< v_~q2_front~0_63 v_~q2_back~0_69) (< v_~q2_front~0_63 v_~n2~0_24)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= v_~q2_front~0_62 (+ v_~q2_front~0_63 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= (select (select |v_#memory_int_101| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* 4 v_~q2_front~0_63))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_63, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_62, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_35, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][499], [118#L95true, Black: 1172#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1526#(<= ~q1_front~0 ~q1_back~0), 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 941#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 939#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 40#L145-2true, Black: 747#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 769#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), 1175#true, Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 687#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))))), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 622#(or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 455#(<= 1 ~total~0), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 1770#true, Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 685#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1434#(and (or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1336#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1482#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1186#(<= 1 ~total~0), 448#true, Black: 1426#(and (= ~total~0 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 1472#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1486#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1468#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1430#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< 0 ~C~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1184#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1460#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1527#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1585#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~N~0) (<= (+ ~q1_front~0 2) ~q1_back~0)), Black: 1748#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1452#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1559#(and (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1470#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1746#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1758#(and (or (< (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1185#(or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1581#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1440#(and (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1756#(and (<= (+ ~q1_front~0 2) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1424#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1448#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1742#(and (<= ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1740#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1)), Black: 1319#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 719#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1517#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1520#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0))]) [2023-08-30 19:59:43,421 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 19:59:43,421 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 19:59:43,421 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 19:59:43,421 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 19:59:43,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_63) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (not (= (ite (and (<= 0 v_~q2_front~0_63) (< v_~q2_front~0_63 v_~q2_back~0_69) (< v_~q2_front~0_63 v_~n2~0_24)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= v_~q2_front~0_62 (+ v_~q2_front~0_63 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= (select (select |v_#memory_int_101| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* 4 v_~q2_front~0_63))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_63, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_62, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_35, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][499], [118#L95true, Black: 1172#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1526#(<= ~q1_front~0 ~q1_back~0), 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 941#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 939#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 747#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 769#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), 1175#true, Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 687#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))))), 111#L146-1true, Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 622#(or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 455#(<= 1 ~total~0), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 1770#true, Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 685#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1434#(and (or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1336#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1482#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1186#(<= 1 ~total~0), 448#true, Black: 1426#(and (= ~total~0 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (< ~q1_front~0 ~n1~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 1472#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1486#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1468#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1430#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (< 0 ~C~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1184#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1460#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_back~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (<= ~n1~0 2)), Black: 1527#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1585#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~N~0) (<= (+ ~q1_front~0 2) ~q1_back~0)), Black: 1748#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1452#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1559#(and (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1470#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1746#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1758#(and (or (< (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1185#(or (<= 1 ~total~0) (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1581#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~N~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1440#(and (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1756#(and (<= (+ ~q1_front~0 2) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1424#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1448#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_410) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_412) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 1742#(and (<= ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1740#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1)), Black: 1319#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 719#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1517#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 1520#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0))]) [2023-08-30 19:59:43,779 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 19:59:43,780 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 19:59:43,780 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 19:59:43,780 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 19:59:44,492 INFO L130 PetriNetUnfolder]: 84015/120648 cut-off events. [2023-08-30 19:59:44,493 INFO L131 PetriNetUnfolder]: For 1441980/1454273 co-relation queries the response was YES. [2023-08-30 19:59:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585491 conditions, 120648 events. 84015/120648 cut-off events. For 1441980/1454273 co-relation queries the response was YES. Maximal size of possible extension queue 5883. Compared 971209 event pairs, 30227 based on Foata normal form. 7474/125734 useless extension candidates. Maximal degree in co-relation 585425. Up to 58749 conditions per place. [2023-08-30 19:59:46,146 INFO L137 encePairwiseOnDemand]: 458/461 looper letters, 894 selfloop transitions, 10 changer transitions 0/1019 dead transitions. [2023-08-30 19:59:46,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1019 transitions, 17540 flow [2023-08-30 19:59:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 19:59:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 19:59:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2023-08-30 19:59:46,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485177151120752 [2023-08-30 19:59:46,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2023-08-30 19:59:46,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2023-08-30 19:59:46,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:59:46,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2023-08-30 19:59:46,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:59:46,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:59:46,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:59:46,151 INFO L175 Difference]: Start difference. First operand has 212 places, 751 transitions, 11359 flow. Second operand 3 states and 671 transitions. [2023-08-30 19:59:46,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1019 transitions, 17540 flow [2023-08-30 20:00:12,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1019 transitions, 17030 flow, removed 214 selfloop flow, removed 3 redundant places. [2023-08-30 20:00:12,341 INFO L231 Difference]: Finished difference. Result has 212 places, 752 transitions, 11343 flow [2023-08-30 20:00:12,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=11017, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=11343, PETRI_PLACES=212, PETRI_TRANSITIONS=752} [2023-08-30 20:00:12,343 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2023-08-30 20:00:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 752 transitions, 11343 flow [2023-08-30 20:00:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:00:12,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:00:12,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1] [2023-08-30 20:00:12,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 20:00:12,344 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 2 more)] === [2023-08-30 20:00:12,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:00:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2090170244, now seen corresponding path program 6 times [2023-08-30 20:00:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:00:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298403216] [2023-08-30 20:00:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:00:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:00:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:00:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:00:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:00:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298403216] [2023-08-30 20:00:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298403216] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:00:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700428820] [2023-08-30 20:00:13,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:00:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:00:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:00:13,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:00:13,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 20:00:13,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 20:00:13,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:00:13,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 20:00:13,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:00:13,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:00:13,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-08-30 20:00:13,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:00:13,947 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 46 treesize of output 12 [2023-08-30 20:00:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:00:13,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:00:14,066 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_619 (Array Int Int))) (< 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) (select .cse0 (+ .cse1 c_~q1~0.offset 4)) c_~total~0)))) is different from false [2023-08-30 20:00:14,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:00:14,126 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 75 treesize of output 77 [2023-08-30 20:00:14,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:00:14,130 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 19 treesize of output 6 [2023-08-30 20:00:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-08-30 20:00:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700428820] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:00:14,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:00:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2023-08-30 20:00:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022354767] [2023-08-30 20:00:14,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:00:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 20:00:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:00:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 20:00:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=624, Unknown=1, NotChecked=50, Total=756 [2023-08-30 20:00:14,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 461 [2023-08-30 20:00:14,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 752 transitions, 11343 flow. Second operand has 28 states, 28 states have (on average 156.89285714285714) internal successors, (4393), 28 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:00:14,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:00:14,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 461 [2023-08-30 20:00:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand