./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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 ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:28:41,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:28:41,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:28:41,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:28:41,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:28:41,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:28:41,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:28:41,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:28:41,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:28:42,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:28:42,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:28:42,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:28:42,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:28:42,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:28:42,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:28:42,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:28:42,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:28:42,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:28:42,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:28:42,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:28:42,018 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:28:42,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:28:42,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:28:42,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:28:42,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:28:42,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:28:42,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:28:42,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:28:42,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:28:42,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:28:42,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:28:42,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:28:42,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:28:42,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:28:42,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:28:42,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:28:42,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:28:42,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:28:42,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:28:42,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:28:42,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:28:42,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:28:42,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:28:42,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:28:42,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:28:42,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:28:42,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:28:42,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:28:42,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:28:42,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:28:42,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:28:42,067 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:28:42,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:28:42,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:28:42,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:28:42,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:28:42,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:28:42,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:28:42,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:28:42,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:28:42,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:28:42,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:28:42,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:28:42,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:28:42,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:28:42,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-07-12 10:28:42,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:28:42,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:28:42,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:28:42,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:28:42,283 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:28:42,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-07-12 10:28:42,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbffecf6/57bd8260b883479b8c47c8d8bd23b038/FLAG246888994 [2022-07-12 10:28:42,659 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:28:42,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-07-12 10:28:42,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbffecf6/57bd8260b883479b8c47c8d8bd23b038/FLAG246888994 [2022-07-12 10:28:43,064 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbffecf6/57bd8260b883479b8c47c8d8bd23b038 [2022-07-12 10:28:43,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:28:43,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:28:43,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:28:43,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:28:43,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:28:43,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ccf056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43, skipping insertion in model container [2022-07-12 10:28:43,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:28:43,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:28:43,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-07-12 10:28:43,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:28:43,295 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:28:43,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-07-12 10:28:43,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:28:43,355 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:28:43,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43 WrapperNode [2022-07-12 10:28:43,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:28:43,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:28:43,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:28:43,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:28:43,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,415 INFO L137 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-07-12 10:28:43,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:28:43,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:28:43,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:28:43,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:28:43,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:28:43,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:28:43,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:28:43,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:28:43,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (1/1) ... [2022-07-12 10:28:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:28:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:28:43,480 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) [2022-07-12 10:28:43,486 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 [2022-07-12 10:28:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:28:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:28:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:28:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:28:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:28:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:28:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:28:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:28:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:28:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:28:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-12 10:28:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-12 10:28:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:28:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:28:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:28:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:28:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:28:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:28:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:28:43,508 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:28:43,588 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:28:43,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:28:43,897 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:28:43,997 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:28:43,997 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 10:28:43,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:28:43 BoogieIcfgContainer [2022-07-12 10:28:43,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:28:44,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:28:44,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:28:44,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:28:44,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:28:43" (1/3) ... [2022-07-12 10:28:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1665ea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:28:44, skipping insertion in model container [2022-07-12 10:28:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:28:43" (2/3) ... [2022-07-12 10:28:44,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1665ea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:28:44, skipping insertion in model container [2022-07-12 10:28:44,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:28:43" (3/3) ... [2022-07-12 10:28:44,008 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-07-12 10:28:44,015 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:28:44,021 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:28:44,021 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:28:44,021 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:28:44,069 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-12 10:28:44,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 245 transitions, 522 flow [2022-07-12 10:28:44,203 INFO L129 PetriNetUnfolder]: 19/241 cut-off events. [2022-07-12 10:28:44,204 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-12 10:28:44,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 19/241 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/221 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2022-07-12 10:28:44,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 245 transitions, 522 flow [2022-07-12 10:28:44,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 480 flow [2022-07-12 10:28:44,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:28:44,233 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33a82f0a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47750c2a [2022-07-12 10:28:44,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-12 10:28:44,271 INFO L129 PetriNetUnfolder]: 19/227 cut-off events. [2022-07-12 10:28:44,272 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-12 10:28:44,272 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:44,273 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:44,274 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)] === [2022-07-12 10:28:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1169175300, now seen corresponding path program 1 times [2022-07-12 10:28:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:44,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445411149] [2022-07-12 10:28:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445411149] [2022-07-12 10:28:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445411149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:44,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:44,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:28:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112700224] [2022-07-12 10:28:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:44,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:28:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:28:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:28:44,549 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 245 [2022-07-12 10:28:44,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 480 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:44,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:44,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 245 [2022-07-12 10:28:44,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:44,671 INFO L129 PetriNetUnfolder]: 123/530 cut-off events. [2022-07-12 10:28:44,671 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-07-12 10:28:44,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 530 events. 123/530 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1703 event pairs, 51 based on Foata normal form. 126/594 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2022-07-12 10:28:44,678 INFO L132 encePairwiseOnDemand]: 232/245 looper letters, 12 selfloop transitions, 0 changer transitions 7/215 dead transitions. [2022-07-12 10:28:44,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 478 flow [2022-07-12 10:28:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:28:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:28:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2022-07-12 10:28:44,692 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9448979591836735 [2022-07-12 10:28:44,692 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2022-07-12 10:28:44,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2022-07-12 10:28:44,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:44,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2022-07-12 10:28:44,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:44,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:44,705 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:44,706 INFO L186 Difference]: Start difference. First operand has 222 places, 228 transitions, 480 flow. Second operand 2 states and 463 transitions. [2022-07-12 10:28:44,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 478 flow [2022-07-12 10:28:44,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 462 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-07-12 10:28:44,714 INFO L242 Difference]: Finished difference. Result has 215 places, 208 transitions, 424 flow [2022-07-12 10:28:44,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=215, PETRI_TRANSITIONS=208} [2022-07-12 10:28:44,721 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-12 10:28:44,721 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 208 transitions, 424 flow [2022-07-12 10:28:44,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:44,722 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:44,722 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:44,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:28:44,722 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)] === [2022-07-12 10:28:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1761120381, now seen corresponding path program 1 times [2022-07-12 10:28:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:44,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588073056] [2022-07-12 10:28:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:44,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:45,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588073056] [2022-07-12 10:28:45,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588073056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:45,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:45,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:28:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526449080] [2022-07-12 10:28:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:45,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:28:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:28:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:28:45,168 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2022-07-12 10:28:45,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 208 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:45,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2022-07-12 10:28:45,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:45,419 INFO L129 PetriNetUnfolder]: 417/981 cut-off events. [2022-07-12 10:28:45,420 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-07-12 10:28:45,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 981 events. 417/981 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4295 event pairs, 71 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1655. Up to 385 conditions per place. [2022-07-12 10:28:45,427 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 61 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2022-07-12 10:28:45,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 226 transitions, 600 flow [2022-07-12 10:28:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:28:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:28:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2022-07-12 10:28:45,431 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.753935860058309 [2022-07-12 10:28:45,431 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1293 transitions. [2022-07-12 10:28:45,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1293 transitions. [2022-07-12 10:28:45,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:45,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1293 transitions. [2022-07-12 10:28:45,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.71428571428572) internal successors, (1293), 7 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,438 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,438 INFO L186 Difference]: Start difference. First operand has 215 places, 208 transitions, 424 flow. Second operand 7 states and 1293 transitions. [2022-07-12 10:28:45,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 226 transitions, 600 flow [2022-07-12 10:28:45,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 226 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:28:45,446 INFO L242 Difference]: Finished difference. Result has 215 places, 209 transitions, 444 flow [2022-07-12 10:28:45,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2022-07-12 10:28:45,447 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-12 10:28:45,447 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 444 flow [2022-07-12 10:28:45,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,448 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:45,448 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:45,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:28:45,449 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)] === [2022-07-12 10:28:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1942679056, now seen corresponding path program 1 times [2022-07-12 10:28:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:45,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69952077] [2022-07-12 10:28:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:45,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69952077] [2022-07-12 10:28:45,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69952077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:45,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:45,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316715243] [2022-07-12 10:28:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:45,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:45,640 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2022-07-12 10:28:45,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 444 flow. Second operand has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:45,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:45,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2022-07-12 10:28:45,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:46,014 INFO L129 PetriNetUnfolder]: 1105/2053 cut-off events. [2022-07-12 10:28:46,015 INFO L130 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-07-12 10:28:46,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4049 conditions, 2053 events. 1105/2053 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10814 event pairs, 123 based on Foata normal form. 0/1878 useless extension candidates. Maximal degree in co-relation 4044. Up to 632 conditions per place. [2022-07-12 10:28:46,029 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 59 selfloop transitions, 19 changer transitions 0/258 dead transitions. [2022-07-12 10:28:46,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 258 transitions, 726 flow [2022-07-12 10:28:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:28:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:28:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2022-07-12 10:28:46,033 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2022-07-12 10:28:46,033 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2022-07-12 10:28:46,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2022-07-12 10:28:46,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:46,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2022-07-12 10:28:46,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,039 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,039 INFO L186 Difference]: Start difference. First operand has 215 places, 209 transitions, 444 flow. Second operand 7 states and 1498 transitions. [2022-07-12 10:28:46,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 258 transitions, 726 flow [2022-07-12 10:28:46,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 258 transitions, 713 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:28:46,045 INFO L242 Difference]: Finished difference. Result has 220 places, 223 transitions, 554 flow [2022-07-12 10:28:46,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=220, PETRI_TRANSITIONS=223} [2022-07-12 10:28:46,046 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -2 predicate places. [2022-07-12 10:28:46,047 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 223 transitions, 554 flow [2022-07-12 10:28:46,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,047 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:46,047 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:28:46,048 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)] === [2022-07-12 10:28:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1928043760, now seen corresponding path program 2 times [2022-07-12 10:28:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:46,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661458849] [2022-07-12 10:28:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661458849] [2022-07-12 10:28:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661458849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:46,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:46,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:28:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061591438] [2022-07-12 10:28:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:46,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:28:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:28:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:28:46,173 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 245 [2022-07-12 10:28:46,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 223 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:46,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 245 [2022-07-12 10:28:46,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:46,684 INFO L129 PetriNetUnfolder]: 1644/3478 cut-off events. [2022-07-12 10:28:46,685 INFO L130 PetriNetUnfolder]: For 2556/2723 co-relation queries the response was YES. [2022-07-12 10:28:46,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8170 conditions, 3478 events. 1644/3478 cut-off events. For 2556/2723 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23771 event pairs, 303 based on Foata normal form. 84/3327 useless extension candidates. Maximal degree in co-relation 8161. Up to 925 conditions per place. [2022-07-12 10:28:46,710 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 96 selfloop transitions, 31 changer transitions 0/283 dead transitions. [2022-07-12 10:28:46,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 283 transitions, 1084 flow [2022-07-12 10:28:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:28:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:28:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1460 transitions. [2022-07-12 10:28:46,713 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7448979591836735 [2022-07-12 10:28:46,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1460 transitions. [2022-07-12 10:28:46,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1460 transitions. [2022-07-12 10:28:46,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:46,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1460 transitions. [2022-07-12 10:28:46,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.5) internal successors, (1460), 8 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,719 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,719 INFO L186 Difference]: Start difference. First operand has 220 places, 223 transitions, 554 flow. Second operand 8 states and 1460 transitions. [2022-07-12 10:28:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 283 transitions, 1084 flow [2022-07-12 10:28:46,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 283 transitions, 1084 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:28:46,728 INFO L242 Difference]: Finished difference. Result has 231 places, 245 transitions, 845 flow [2022-07-12 10:28:46,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=845, PETRI_PLACES=231, PETRI_TRANSITIONS=245} [2022-07-12 10:28:46,729 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 9 predicate places. [2022-07-12 10:28:46,729 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 245 transitions, 845 flow [2022-07-12 10:28:46,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,730 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:46,730 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:46,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:28:46,730 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)] === [2022-07-12 10:28:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 924192328, now seen corresponding path program 3 times [2022-07-12 10:28:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:46,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579196810] [2022-07-12 10:28:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:46,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579196810] [2022-07-12 10:28:46,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579196810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:46,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:46,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519485129] [2022-07-12 10:28:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:46,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:46,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:46,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:46,856 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-12 10:28:46,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 245 transitions, 845 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:46,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:46,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-12 10:28:46,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:47,761 INFO L129 PetriNetUnfolder]: 3510/6037 cut-off events. [2022-07-12 10:28:47,761 INFO L130 PetriNetUnfolder]: For 9890/9890 co-relation queries the response was YES. [2022-07-12 10:28:47,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18197 conditions, 6037 events. 3510/6037 cut-off events. For 9890/9890 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41243 event pairs, 224 based on Foata normal form. 42/5929 useless extension candidates. Maximal degree in co-relation 18183. Up to 1900 conditions per place. [2022-07-12 10:28:47,829 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 84 selfloop transitions, 54 changer transitions 0/322 dead transitions. [2022-07-12 10:28:47,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 322 transitions, 1686 flow [2022-07-12 10:28:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:28:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-12 10:28:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2022-07-12 10:28:47,832 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8925170068027211 [2022-07-12 10:28:47,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2022-07-12 10:28:47,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2022-07-12 10:28:47,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:47,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2022-07-12 10:28:47,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:47,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:47,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:47,843 INFO L186 Difference]: Start difference. First operand has 231 places, 245 transitions, 845 flow. Second operand 6 states and 1312 transitions. [2022-07-12 10:28:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 322 transitions, 1686 flow [2022-07-12 10:28:47,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 322 transitions, 1681 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:28:47,868 INFO L242 Difference]: Finished difference. Result has 237 places, 278 transitions, 1399 flow [2022-07-12 10:28:47,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1399, PETRI_PLACES=237, PETRI_TRANSITIONS=278} [2022-07-12 10:28:47,870 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 15 predicate places. [2022-07-12 10:28:47,870 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 278 transitions, 1399 flow [2022-07-12 10:28:47,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:47,870 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:47,871 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:47,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:28:47,871 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)] === [2022-07-12 10:28:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash -317948234, now seen corresponding path program 4 times [2022-07-12 10:28:47,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:47,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632535315] [2022-07-12 10:28:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:47,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:48,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632535315] [2022-07-12 10:28:48,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632535315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:48,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:48,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796753665] [2022-07-12 10:28:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:48,006 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-12 10:28:48,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 278 transitions, 1399 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:48,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:48,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-12 10:28:48,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:49,409 INFO L129 PetriNetUnfolder]: 5382/10455 cut-off events. [2022-07-12 10:28:49,409 INFO L130 PetriNetUnfolder]: For 24939/24939 co-relation queries the response was YES. [2022-07-12 10:28:49,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31123 conditions, 10455 events. 5382/10455 cut-off events. For 24939/24939 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 87327 event pairs, 789 based on Foata normal form. 42/9925 useless extension candidates. Maximal degree in co-relation 31105. Up to 2862 conditions per place. [2022-07-12 10:28:49,504 INFO L132 encePairwiseOnDemand]: 239/245 looper letters, 119 selfloop transitions, 45 changer transitions 0/348 dead transitions. [2022-07-12 10:28:49,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 348 transitions, 2352 flow [2022-07-12 10:28:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:28:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:28:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1097 transitions. [2022-07-12 10:28:49,507 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8955102040816326 [2022-07-12 10:28:49,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1097 transitions. [2022-07-12 10:28:49,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1097 transitions. [2022-07-12 10:28:49,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:49,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1097 transitions. [2022-07-12 10:28:49,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 219.4) internal successors, (1097), 5 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:49,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:49,511 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:49,511 INFO L186 Difference]: Start difference. First operand has 237 places, 278 transitions, 1399 flow. Second operand 5 states and 1097 transitions. [2022-07-12 10:28:49,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 348 transitions, 2352 flow [2022-07-12 10:28:49,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 348 transitions, 2296 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-07-12 10:28:49,571 INFO L242 Difference]: Finished difference. Result has 244 places, 306 transitions, 1912 flow [2022-07-12 10:28:49,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1912, PETRI_PLACES=244, PETRI_TRANSITIONS=306} [2022-07-12 10:28:49,572 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 22 predicate places. [2022-07-12 10:28:49,572 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 306 transitions, 1912 flow [2022-07-12 10:28:49,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:49,572 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:49,573 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:49,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:28:49,573 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)] === [2022-07-12 10:28:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 9020230, now seen corresponding path program 5 times [2022-07-12 10:28:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:49,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756723186] [2022-07-12 10:28:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:49,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756723186] [2022-07-12 10:28:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756723186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:49,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:49,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563219144] [2022-07-12 10:28:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:49,723 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-12 10:28:49,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 306 transitions, 1912 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:49,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:49,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-12 10:28:49,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:51,134 INFO L129 PetriNetUnfolder]: 5517/9983 cut-off events. [2022-07-12 10:28:51,134 INFO L130 PetriNetUnfolder]: For 33294/33364 co-relation queries the response was YES. [2022-07-12 10:28:51,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32741 conditions, 9983 events. 5517/9983 cut-off events. For 33294/33364 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 77143 event pairs, 570 based on Foata normal form. 43/9646 useless extension candidates. Maximal degree in co-relation 32719. Up to 2929 conditions per place. [2022-07-12 10:28:51,208 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 112 selfloop transitions, 71 changer transitions 0/367 dead transitions. [2022-07-12 10:28:51,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 367 transitions, 2944 flow [2022-07-12 10:28:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:28:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:28:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1093 transitions. [2022-07-12 10:28:51,210 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8922448979591837 [2022-07-12 10:28:51,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1093 transitions. [2022-07-12 10:28:51,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1093 transitions. [2022-07-12 10:28:51,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:51,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1093 transitions. [2022-07-12 10:28:51,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:51,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:51,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:51,214 INFO L186 Difference]: Start difference. First operand has 244 places, 306 transitions, 1912 flow. Second operand 5 states and 1093 transitions. [2022-07-12 10:28:51,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 367 transitions, 2944 flow [2022-07-12 10:28:51,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 367 transitions, 2935 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-12 10:28:51,247 INFO L242 Difference]: Finished difference. Result has 251 places, 336 transitions, 2706 flow [2022-07-12 10:28:51,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2706, PETRI_PLACES=251, PETRI_TRANSITIONS=336} [2022-07-12 10:28:51,248 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 29 predicate places. [2022-07-12 10:28:51,248 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 336 transitions, 2706 flow [2022-07-12 10:28:51,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:51,248 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:51,249 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:51,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:28:51,249 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)] === [2022-07-12 10:28:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -842712950, now seen corresponding path program 6 times [2022-07-12 10:28:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:51,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416045609] [2022-07-12 10:28:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416045609] [2022-07-12 10:28:51,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416045609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:51,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:51,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447272560] [2022-07-12 10:28:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:51,320 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-12 10:28:51,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 336 transitions, 2706 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:51,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:51,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-12 10:28:51,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:52,554 INFO L129 PetriNetUnfolder]: 5138/9387 cut-off events. [2022-07-12 10:28:52,554 INFO L130 PetriNetUnfolder]: For 43500/43512 co-relation queries the response was YES. [2022-07-12 10:28:52,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35147 conditions, 9387 events. 5138/9387 cut-off events. For 43500/43512 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 73085 event pairs, 1783 based on Foata normal form. 24/9110 useless extension candidates. Maximal degree in co-relation 35122. Up to 6306 conditions per place. [2022-07-12 10:28:52,783 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 171 selfloop transitions, 13 changer transitions 0/368 dead transitions. [2022-07-12 10:28:52,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 368 transitions, 3317 flow [2022-07-12 10:28:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:28:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:28:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1088 transitions. [2022-07-12 10:28:52,787 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8881632653061224 [2022-07-12 10:28:52,787 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1088 transitions. [2022-07-12 10:28:52,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1088 transitions. [2022-07-12 10:28:52,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:52,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1088 transitions. [2022-07-12 10:28:52,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 217.6) internal successors, (1088), 5 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:52,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:52,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:52,791 INFO L186 Difference]: Start difference. First operand has 251 places, 336 transitions, 2706 flow. Second operand 5 states and 1088 transitions. [2022-07-12 10:28:52,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 368 transitions, 3317 flow [2022-07-12 10:28:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 368 transitions, 3315 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-07-12 10:28:52,849 INFO L242 Difference]: Finished difference. Result has 257 places, 339 transitions, 2795 flow [2022-07-12 10:28:52,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2795, PETRI_PLACES=257, PETRI_TRANSITIONS=339} [2022-07-12 10:28:52,850 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 35 predicate places. [2022-07-12 10:28:52,850 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 339 transitions, 2795 flow [2022-07-12 10:28:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:52,851 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:52,851 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:28:52,851 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)] === [2022-07-12 10:28:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1004322472, now seen corresponding path program 7 times [2022-07-12 10:28:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:52,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073767125] [2022-07-12 10:28:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:52,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073767125] [2022-07-12 10:28:52,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073767125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:52,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:52,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:28:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817216686] [2022-07-12 10:28:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:52,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:28:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:28:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:28:52,977 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-12 10:28:52,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 339 transitions, 2795 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:52,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:52,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-12 10:28:52,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:54,544 INFO L129 PetriNetUnfolder]: 5845/10091 cut-off events. [2022-07-12 10:28:54,545 INFO L130 PetriNetUnfolder]: For 50752/50752 co-relation queries the response was YES. [2022-07-12 10:28:54,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40391 conditions, 10091 events. 5845/10091 cut-off events. For 50752/50752 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 75821 event pairs, 194 based on Foata normal form. 18/9992 useless extension candidates. Maximal degree in co-relation 40363. Up to 2738 conditions per place. [2022-07-12 10:28:54,653 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 168 selfloop transitions, 54 changer transitions 0/406 dead transitions. [2022-07-12 10:28:54,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 406 transitions, 3990 flow [2022-07-12 10:28:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:28:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:28:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1094 transitions. [2022-07-12 10:28:54,656 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.893061224489796 [2022-07-12 10:28:54,656 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1094 transitions. [2022-07-12 10:28:54,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1094 transitions. [2022-07-12 10:28:54,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:54,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1094 transitions. [2022-07-12 10:28:54,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.8) internal successors, (1094), 5 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:54,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:54,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:54,661 INFO L186 Difference]: Start difference. First operand has 257 places, 339 transitions, 2795 flow. Second operand 5 states and 1094 transitions. [2022-07-12 10:28:54,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 406 transitions, 3990 flow [2022-07-12 10:28:54,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 406 transitions, 3967 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-07-12 10:28:54,823 INFO L242 Difference]: Finished difference. Result has 262 places, 362 transitions, 3427 flow [2022-07-12 10:28:54,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2760, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3427, PETRI_PLACES=262, PETRI_TRANSITIONS=362} [2022-07-12 10:28:54,824 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 40 predicate places. [2022-07-12 10:28:54,825 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 362 transitions, 3427 flow [2022-07-12 10:28:54,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:54,825 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:54,825 INFO L200 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:28:54,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:28:54,826 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)] === [2022-07-12 10:28:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2123012021, now seen corresponding path program 1 times [2022-07-12 10:28:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505105743] [2022-07-12 10:28:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:28:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:54,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505105743] [2022-07-12 10:28:54,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505105743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:28:54,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:28:54,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:28:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199206848] [2022-07-12 10:28:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:28:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:28:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:28:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:28:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:28:54,901 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-12 10:28:54,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 362 transitions, 3427 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:54,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:28:54,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-12 10:28:54,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:28:55,764 INFO L129 PetriNetUnfolder]: 2348/5677 cut-off events. [2022-07-12 10:28:55,764 INFO L130 PetriNetUnfolder]: For 55376/60946 co-relation queries the response was YES. [2022-07-12 10:28:55,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24797 conditions, 5677 events. 2348/5677 cut-off events. For 55376/60946 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 46904 event pairs, 834 based on Foata normal form. 634/5977 useless extension candidates. Maximal degree in co-relation 24766. Up to 2361 conditions per place. [2022-07-12 10:28:55,830 INFO L132 encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 8 changer transitions 19/385 dead transitions. [2022-07-12 10:28:55,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 385 transitions, 3715 flow [2022-07-12 10:28:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:28:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:28:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1800 transitions. [2022-07-12 10:28:55,834 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2022-07-12 10:28:55,834 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1800 transitions. [2022-07-12 10:28:55,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1800 transitions. [2022-07-12 10:28:55,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:28:55,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1800 transitions. [2022-07-12 10:28:55,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:55,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:55,841 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:55,841 INFO L186 Difference]: Start difference. First operand has 262 places, 362 transitions, 3427 flow. Second operand 9 states and 1800 transitions. [2022-07-12 10:28:55,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 385 transitions, 3715 flow [2022-07-12 10:28:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 385 transitions, 3706 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-12 10:28:55,911 INFO L242 Difference]: Finished difference. Result has 271 places, 363 transitions, 3458 flow [2022-07-12 10:28:55,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3418, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3458, PETRI_PLACES=271, PETRI_TRANSITIONS=363} [2022-07-12 10:28:55,912 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 49 predicate places. [2022-07-12 10:28:55,912 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 363 transitions, 3458 flow [2022-07-12 10:28:55,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:28:55,913 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:28:55,913 INFO L200 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, 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, 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, 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, 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, 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] [2022-07-12 10:28:55,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:28:55,913 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)] === [2022-07-12 10:28:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:28:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash 930183216, now seen corresponding path program 1 times [2022-07-12 10:28:55,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:28:55,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260415124] [2022-07-12 10:28:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:28:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:28:56,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260415124] [2022-07-12 10:28:56,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260415124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:28:56,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255496707] [2022-07-12 10:28:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:28:56,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:28:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:28:56,491 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) [2022-07-12 10:28:56,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:28:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:28:56,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 10:28:56,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:28:56,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-07-12 10:28:56,842 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 10:28:56,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 10:28:56,882 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-12 10:28:56,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-07-12 10:28:57,495 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-12 10:28:57,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2022-07-12 10:28:57,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-07-12 10:28:58,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:28:58,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:28:58,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:28:58,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:28:59,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:28:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:28:59,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:00,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:29:00,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:00,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1267 treesize of output 1235 [2022-07-12 10:29:00,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 629 treesize of output 605 [2022-07-12 10:29:00,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1211 treesize of output 1019 [2022-07-12 10:29:00,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1019 treesize of output 923 [2022-07-12 10:29:00,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 923 treesize of output 875 [2022-07-12 10:29:02,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:02,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255496707] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:02,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:02,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29, 26] total 66 [2022-07-12 10:29:02,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408554566] [2022-07-12 10:29:02,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:02,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-12 10:29:02,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-12 10:29:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=3512, Unknown=72, NotChecked=0, Total=4290 [2022-07-12 10:29:02,457 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2022-07-12 10:29:02,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 363 transitions, 3458 flow. Second operand has 66 states, 66 states have (on average 114.78787878787878) internal successors, (7576), 66 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:02,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:02,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2022-07-12 10:29:02,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:12,528 INFO L129 PetriNetUnfolder]: 16249/31797 cut-off events. [2022-07-12 10:29:12,529 INFO L130 PetriNetUnfolder]: For 314882/320916 co-relation queries the response was YES. [2022-07-12 10:29:12,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147514 conditions, 31797 events. 16249/31797 cut-off events. For 314882/320916 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 309087 event pairs, 1087 based on Foata normal form. 2446/33283 useless extension candidates. Maximal degree in co-relation 147481. Up to 10304 conditions per place. [2022-07-12 10:29:12,967 INFO L132 encePairwiseOnDemand]: 202/245 looper letters, 662 selfloop transitions, 161 changer transitions 16/965 dead transitions. [2022-07-12 10:29:12,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 965 transitions, 13687 flow [2022-07-12 10:29:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 10:29:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-12 10:29:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 6404 transitions. [2022-07-12 10:29:12,986 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4752504638218924 [2022-07-12 10:29:12,987 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 6404 transitions. [2022-07-12 10:29:12,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 6404 transitions. [2022-07-12 10:29:12,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:12,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 6404 transitions. [2022-07-12 10:29:12,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 116.43636363636364) internal successors, (6404), 55 states have internal predecessors, (6404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:13,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 245.0) internal successors, (13720), 56 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:13,011 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 245.0) internal successors, (13720), 56 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:13,011 INFO L186 Difference]: Start difference. First operand has 271 places, 363 transitions, 3458 flow. Second operand 55 states and 6404 transitions. [2022-07-12 10:29:13,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 965 transitions, 13687 flow [2022-07-12 10:29:13,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 965 transitions, 13575 flow, removed 46 selfloop flow, removed 6 redundant places. [2022-07-12 10:29:13,394 INFO L242 Difference]: Finished difference. Result has 345 places, 515 transitions, 6160 flow [2022-07-12 10:29:13,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3428, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=6160, PETRI_PLACES=345, PETRI_TRANSITIONS=515} [2022-07-12 10:29:13,395 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 123 predicate places. [2022-07-12 10:29:13,395 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 515 transitions, 6160 flow [2022-07-12 10:29:13,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 114.78787878787878) internal successors, (7576), 66 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:13,397 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:13,397 INFO L200 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, 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, 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, 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, 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, 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] [2022-07-12 10:29:13,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:13,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 10:29:13,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:29:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash -285812815, now seen corresponding path program 1 times [2022-07-12 10:29:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:13,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511415035] [2022-07-12 10:29:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 10:29:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511415035] [2022-07-12 10:29:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511415035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:13,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:13,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:29:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299342865] [2022-07-12 10:29:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:13,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:29:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:29:13,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:29:13,681 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-12 10:29:13,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 515 transitions, 6160 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:13,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:13,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-12 10:29:13,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:16,388 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_front~0_43)))) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ v_~total~0_61 2147483648)) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (<= v_~total~0_61 2147483647) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][511], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 163#L110true, 299#true, Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), 263#true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 122#L92true, 320#true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 13#L56true, 176#L143-4true, 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2022-07-12 10:29:16,390 INFO L384 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-07-12 10:29:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-12 10:29:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-12 10:29:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-07-12 10:29:16,593 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([855] L52-->L56: Formula: (let ((.cse0 (not |v_thread1_#t~short2#1_43|))) (and (let ((.cse2 (<= 0 v_~q1_back~0_46)) (.cse1 (< v_~q1_back~0_46 v_~n1~0_14))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 |v_thread1_#t~short2#1_43| .cse1))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= v_~i~0_44 (+ v_~i~0_45 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (or (and (let ((.cse3 (= |v_thread1_#t~mem1#1_32| v_~C~0_13))) (or (and .cse3 |v_thread1_#t~short2#1_44|) (and (not .cse3) (not |v_thread1_#t~short2#1_44|)))) (= (select (select |v_#memory_int_59| v_~q1~0.base_19) (+ v_~q1~0.offset_19 (* 4 v_~q1_back~0_46))) |v_thread1_#t~mem1#1_32|) |v_thread1_#t~short2#1_43|) (and .cse0 (= |v_thread1_#t~mem1#1_32| |v_thread1Thread1of1ForFork2_#t~mem1#1_1|) (= |v_thread1_#t~short2#1_43| |v_thread1_#t~short2#1_44|))) (= (ite |v_thread1_#t~short2#1_44| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ 1 v_~q1_back~0_46) v_~q1_back~0_45))) InVars {~q1~0.offset=v_~q1~0.offset_19, ~i~0=v_~i~0_45, ~q1_back~0=v_~q1_back~0_46, ~C~0=v_~C~0_13, ~n1~0=v_~n1~0_14, ~q1~0.base=v_~q1~0.base_19, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_19, ~i~0=v_~i~0_44, ~C~0=v_~C~0_13, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_1|, ~n1~0=v_~n1~0_14, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_45, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_19, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~short2#1_44|, |v_thread1_#t~short2#1_43|, |v_thread1_#t~mem1#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1][399], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 299#true, Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), 263#true, 94#L95true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 320#true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 13#L56true, 176#L143-4true]) [2022-07-12 10:29:16,595 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-07-12 10:29:16,595 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-12 10:29:16,595 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-07-12 10:29:16,595 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-12 10:29:16,595 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_front~0_43)))) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ v_~total~0_61 2147483648)) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (<= v_~total~0_61 2147483647) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][532], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), 265#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 113#L52true, Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 320#true, 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, Black: 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 242#true, Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 122#L92true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 176#L143-4true, 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2022-07-12 10:29:16,596 INFO L384 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-07-12 10:29:16,596 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-12 10:29:16,596 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-12 10:29:16,596 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-12 10:29:17,047 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([890] thread1EXIT-->L144-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][549], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), 265#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 62#L144-2true, Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 320#true, 94#L95true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, Black: 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))]) [2022-07-12 10:29:17,048 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-07-12 10:29:17,049 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-12 10:29:17,049 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-12 10:29:17,049 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-12 10:29:18,253 INFO L129 PetriNetUnfolder]: 9168/22632 cut-off events. [2022-07-12 10:29:18,253 INFO L130 PetriNetUnfolder]: For 247910/263193 co-relation queries the response was YES. [2022-07-12 10:29:18,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111342 conditions, 22632 events. 9168/22632 cut-off events. For 247910/263193 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 246342 event pairs, 1889 based on Foata normal form. 2962/24552 useless extension candidates. Maximal degree in co-relation 111282. Up to 7456 conditions per place. [2022-07-12 10:29:18,591 INFO L132 encePairwiseOnDemand]: 236/245 looper letters, 333 selfloop transitions, 8 changer transitions 47/671 dead transitions. [2022-07-12 10:29:18,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 671 transitions, 9797 flow [2022-07-12 10:29:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:29:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:29:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1406 transitions. [2022-07-12 10:29:18,592 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8198250728862974 [2022-07-12 10:29:18,593 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1406 transitions. [2022-07-12 10:29:18,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1406 transitions. [2022-07-12 10:29:18,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:18,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1406 transitions. [2022-07-12 10:29:18,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.85714285714286) internal successors, (1406), 7 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:18,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:18,596 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:18,596 INFO L186 Difference]: Start difference. First operand has 345 places, 515 transitions, 6160 flow. Second operand 7 states and 1406 transitions. [2022-07-12 10:29:18,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 671 transitions, 9797 flow [2022-07-12 10:29:18,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 671 transitions, 9697 flow, removed 36 selfloop flow, removed 18 redundant places. [2022-07-12 10:29:18,972 INFO L242 Difference]: Finished difference. Result has 330 places, 517 transitions, 6136 flow [2022-07-12 10:29:18,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=6088, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6136, PETRI_PLACES=330, PETRI_TRANSITIONS=517} [2022-07-12 10:29:18,973 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 108 predicate places. [2022-07-12 10:29:18,973 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 517 transitions, 6136 flow [2022-07-12 10:29:18,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:18,974 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:18,974 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 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] [2022-07-12 10:29:18,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:29:18,974 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:29:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1842698929, now seen corresponding path program 2 times [2022-07-12 10:29:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:18,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469765706] [2022-07-12 10:29:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469765706] [2022-07-12 10:29:20,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469765706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123267122] [2022-07-12 10:29:20,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:29:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:20,149 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) [2022-07-12 10:29:20,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:29:20,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:20,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:20,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 10:29:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:20,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-07-12 10:29:20,800 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:29:20,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-12 10:29:21,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:21,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:22,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:29:22,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-12 10:29:22,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:29:22,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-12 10:29:22,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:22,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:22,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:24,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:29:24,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 52 [2022-07-12 10:29:24,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 695 treesize of output 671 [2022-07-12 10:29:24,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 650 treesize of output 626 [2022-07-12 10:29:24,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 626 treesize of output 530 [2022-07-12 10:29:24,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 530 treesize of output 482 [2022-07-12 10:29:24,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 260 treesize of output 242 [2022-07-12 10:29:26,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:26,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:26,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:29:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:26,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123267122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:26,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:26,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 81 [2022-07-12 10:29:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288185513] [2022-07-12 10:29:26,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-12 10:29:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-12 10:29:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=5922, Unknown=59, NotChecked=0, Total=6480 [2022-07-12 10:29:26,498 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2022-07-12 10:29:26,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 517 transitions, 6136 flow. Second operand has 81 states, 81 states have (on average 112.41975308641975) internal successors, (9106), 81 states have internal predecessors, (9106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:26,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:26,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2022-07-12 10:29:26,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand