./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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-more-buffer-mult.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 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:52:37,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:52:37,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:52:37,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:52:37,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:52:37,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:52:37,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:52:37,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:52:37,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:52:37,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:52:37,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:52:37,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:52:37,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:52:37,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:52:37,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:52:37,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:52:37,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:52:37,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:52:37,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:52:37,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:52:37,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:52:37,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:52:37,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:52:37,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:52:37,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:52:37,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:52:37,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:52:37,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:52:37,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:52:37,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:52:37,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:52:37,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:52:37,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:52:37,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:52:37,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:52:37,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:52:37,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:52:37,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:52:37,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:52:37,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:52:37,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:52:37,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:52:37,942 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:52:37,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:52:37,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:52:37,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:52:37,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:52:37,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:52:37,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:52:37,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:52:37,951 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:52:37,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:52:37,952 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:52:37,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:52:37,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:52:37,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:52:37,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:52:37,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:52:37,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:52:37,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:52:37,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:52:37,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:52:37,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:52:37,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:52:37,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:52:37,956 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 -> 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 [2021-12-14 16:52:38,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:52:38,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:52:38,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:52:38,135 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:52:38,135 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:52:38,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2021-12-14 16:52:38,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2150b2951/8ccabb9f234049d4a2c93a264120beca/FLAGb90468b83 [2021-12-14 16:52:38,596 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:52:38,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2021-12-14 16:52:38,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2150b2951/8ccabb9f234049d4a2c93a264120beca/FLAGb90468b83 [2021-12-14 16:52:39,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2150b2951/8ccabb9f234049d4a2c93a264120beca [2021-12-14 16:52:39,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:52:39,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:52:39,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:52:39,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:52:39,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:52:39,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df2f14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39, skipping insertion in model container [2021-12-14 16:52:39,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:52:39,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:52:39,178 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-more-buffer-mult.wvr.c[4218,4231] [2021-12-14 16:52:39,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:52:39,189 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:52:39,211 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-more-buffer-mult.wvr.c[4218,4231] [2021-12-14 16:52:39,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:52:39,223 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:52:39,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39 WrapperNode [2021-12-14 16:52:39,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:52:39,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:52:39,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:52:39,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:52:39,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,257 INFO L137 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 307 [2021-12-14 16:52:39,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:52:39,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:52:39,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:52:39,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:52:39,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:52:39,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:52:39,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:52:39,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:52:39,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (1/1) ... [2021-12-14 16:52:39,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:52:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:52:39,309 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) [2021-12-14 16:52:39,311 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 [2021-12-14 16:52:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:52:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:52:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:52:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 16:52:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-14 16:52:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-14 16:52:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-14 16:52:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-14 16:52:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-14 16:52:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-14 16:52:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-14 16:52:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-14 16:52:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:52:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:52:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:52:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 16:52:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:52:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:52:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:52:39,335 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:52:39,410 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:52:39,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:52:39,666 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:52:39,798 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:52:39,804 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 16:52:39,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:52:39 BoogieIcfgContainer [2021-12-14 16:52:39,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:52:39,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:52:39,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:52:39,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:52:39,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:52:39" (1/3) ... [2021-12-14 16:52:39,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f8e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:52:39, skipping insertion in model container [2021-12-14 16:52:39,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:52:39" (2/3) ... [2021-12-14 16:52:39,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f8e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:52:39, skipping insertion in model container [2021-12-14 16:52:39,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:52:39" (3/3) ... [2021-12-14 16:52:39,817 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2021-12-14 16:52:39,821 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:52:39,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:52:39,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 16:52:39,821 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:52:39,846 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,848 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,849 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,878 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,878 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,878 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,878 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,879 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,880 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,886 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,886 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,886 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,886 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,886 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,887 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,888 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,889 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:52:39,893 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-14 16:52:39,931 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:52:39,938 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:52:39,939 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-14 16:52:39,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 226 places, 231 transitions, 494 flow [2021-12-14 16:52:40,038 INFO L129 PetriNetUnfolder]: 18/227 cut-off events. [2021-12-14 16:52:40,038 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:52:40,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2021-12-14 16:52:40,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 231 transitions, 494 flow [2021-12-14 16:52:40,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 214 transitions, 452 flow [2021-12-14 16:52:40,070 INFO L129 PetriNetUnfolder]: 18/213 cut-off events. [2021-12-14 16:52:40,071 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:52:40,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:40,072 INFO L254 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] [2021-12-14 16:52:40,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 438311406, now seen corresponding path program 1 times [2021-12-14 16:52:40,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:40,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988548933] [2021-12-14 16:52:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:40,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:40,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988548933] [2021-12-14 16:52:40,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988548933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:40,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:40,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:52:40,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776199138] [2021-12-14 16:52:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:40,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 16:52:40,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 16:52:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 16:52:40,349 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 231 [2021-12-14 16:52:40,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 214 transitions, 452 flow. Second operand has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:40,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 231 [2021-12-14 16:52:40,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:40,523 INFO L129 PetriNetUnfolder]: 226/753 cut-off events. [2021-12-14 16:52:40,523 INFO L130 PetriNetUnfolder]: For 145/146 co-relation queries the response was YES. [2021-12-14 16:52:40,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 753 events. 226/753 cut-off events. For 145/146 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3398 event pairs, 121 based on Foata normal form. 197/864 useless extension candidates. Maximal degree in co-relation 906. Up to 306 conditions per place. [2021-12-14 16:52:40,533 INFO L132 encePairwiseOnDemand]: 219/231 looper letters, 14 selfloop transitions, 0 changer transitions 6/202 dead transitions. [2021-12-14 16:52:40,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 202 transitions, 456 flow [2021-12-14 16:52:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 16:52:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-14 16:52:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 434 transitions. [2021-12-14 16:52:40,548 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2021-12-14 16:52:40,549 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 434 transitions. [2021-12-14 16:52:40,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 434 transitions. [2021-12-14 16:52:40,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:40,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 434 transitions. [2021-12-14 16:52:40,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,566 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,567 INFO L186 Difference]: Start difference. First operand has 209 places, 214 transitions, 452 flow. Second operand 2 states and 434 transitions. [2021-12-14 16:52:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 202 transitions, 456 flow [2021-12-14 16:52:40,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 202 transitions, 440 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-14 16:52:40,575 INFO L242 Difference]: Finished difference. Result has 202 places, 196 transitions, 400 flow [2021-12-14 16:52:40,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=400, PETRI_PLACES=202, PETRI_TRANSITIONS=196} [2021-12-14 16:52:40,579 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -7 predicate places. [2021-12-14 16:52:40,580 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 400 flow [2021-12-14 16:52:40,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,587 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:40,587 INFO L254 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] [2021-12-14 16:52:40,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:52:40,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1838195375, now seen corresponding path program 1 times [2021-12-14 16:52:40,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176865592] [2021-12-14 16:52:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:40,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:40,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:40,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176865592] [2021-12-14 16:52:40,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176865592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:40,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:40,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 16:52:40,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739703149] [2021-12-14 16:52:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:40,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:52:40,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:52:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 16:52:40,913 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 231 [2021-12-14 16:52:40,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:40,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:40,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 231 [2021-12-14 16:52:40,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:41,085 INFO L129 PetriNetUnfolder]: 251/831 cut-off events. [2021-12-14 16:52:41,085 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2021-12-14 16:52:41,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 831 events. 251/831 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3898 event pairs, 32 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 1224. Up to 249 conditions per place. [2021-12-14 16:52:41,094 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 46 selfloop transitions, 3 changer transitions 4/210 dead transitions. [2021-12-14 16:52:41,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 210 transitions, 539 flow [2021-12-14 16:52:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 16:52:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-14 16:52:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2021-12-14 16:52:41,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7956709956709956 [2021-12-14 16:52:41,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2021-12-14 16:52:41,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2021-12-14 16:52:41,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:41,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2021-12-14 16:52:41,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,102 INFO L186 Difference]: Start difference. First operand has 202 places, 196 transitions, 400 flow. Second operand 5 states and 919 transitions. [2021-12-14 16:52:41,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 210 transitions, 539 flow [2021-12-14 16:52:41,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 210 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-14 16:52:41,110 INFO L242 Difference]: Finished difference. Result has 203 places, 198 transitions, 423 flow [2021-12-14 16:52:41,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2021-12-14 16:52:41,111 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -6 predicate places. [2021-12-14 16:52:41,111 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 423 flow [2021-12-14 16:52:41,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:41,112 INFO L254 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] [2021-12-14 16:52:41,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:52:41,112 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash -751491566, now seen corresponding path program 1 times [2021-12-14 16:52:41,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532407261] [2021-12-14 16:52:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:41,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:41,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532407261] [2021-12-14 16:52:41,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532407261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:41,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:41,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 16:52:41,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969361220] [2021-12-14 16:52:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:41,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:52:41,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:52:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:52:41,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2021-12-14 16:52:41,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:41,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2021-12-14 16:52:41,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:41,355 INFO L129 PetriNetUnfolder]: 395/1111 cut-off events. [2021-12-14 16:52:41,355 INFO L130 PetriNetUnfolder]: For 214/216 co-relation queries the response was YES. [2021-12-14 16:52:41,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 1111 events. 395/1111 cut-off events. For 214/216 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5712 event pairs, 70 based on Foata normal form. 18/1017 useless extension candidates. Maximal degree in co-relation 1903. Up to 431 conditions per place. [2021-12-14 16:52:41,362 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 33 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2021-12-14 16:52:41,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 211 transitions, 531 flow [2021-12-14 16:52:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:52:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:52:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2021-12-14 16:52:41,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-12-14 16:52:41,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2021-12-14 16:52:41,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2021-12-14 16:52:41,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:41,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2021-12-14 16:52:41,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,370 INFO L186 Difference]: Start difference. First operand has 203 places, 198 transitions, 423 flow. Second operand 3 states and 627 transitions. [2021-12-14 16:52:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 211 transitions, 531 flow [2021-12-14 16:52:41,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 211 transitions, 523 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-14 16:52:41,374 INFO L242 Difference]: Finished difference. Result has 201 places, 199 transitions, 430 flow [2021-12-14 16:52:41,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=201, PETRI_TRANSITIONS=199} [2021-12-14 16:52:41,376 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -8 predicate places. [2021-12-14 16:52:41,376 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 430 flow [2021-12-14 16:52:41,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:41,377 INFO L254 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] [2021-12-14 16:52:41,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:52:41,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash 952485664, now seen corresponding path program 1 times [2021-12-14 16:52:41,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:41,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410378292] [2021-12-14 16:52:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:41,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:52:41,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:41,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410378292] [2021-12-14 16:52:41,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410378292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:41,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:41,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 16:52:41,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949446681] [2021-12-14 16:52:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:41,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:52:41,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:52:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:52:41,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2021-12-14 16:52:41,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:41,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2021-12-14 16:52:41,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:41,551 INFO L129 PetriNetUnfolder]: 299/1051 cut-off events. [2021-12-14 16:52:41,551 INFO L130 PetriNetUnfolder]: For 359/360 co-relation queries the response was YES. [2021-12-14 16:52:41,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 1051 events. 299/1051 cut-off events. For 359/360 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5555 event pairs, 106 based on Foata normal form. 14/916 useless extension candidates. Maximal degree in co-relation 1776. Up to 353 conditions per place. [2021-12-14 16:52:41,558 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 34 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2021-12-14 16:52:41,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 212 transitions, 547 flow [2021-12-14 16:52:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:52:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:52:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2021-12-14 16:52:41,560 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9033189033189033 [2021-12-14 16:52:41,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2021-12-14 16:52:41,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2021-12-14 16:52:41,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:41,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2021-12-14 16:52:41,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,563 INFO L186 Difference]: Start difference. First operand has 201 places, 199 transitions, 430 flow. Second operand 3 states and 626 transitions. [2021-12-14 16:52:41,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 212 transitions, 547 flow [2021-12-14 16:52:41,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 212 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:52:41,566 INFO L242 Difference]: Finished difference. Result has 203 places, 200 transitions, 442 flow [2021-12-14 16:52:41,567 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=203, PETRI_TRANSITIONS=200} [2021-12-14 16:52:41,567 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -6 predicate places. [2021-12-14 16:52:41,567 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 200 transitions, 442 flow [2021-12-14 16:52:41,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:41,568 INFO L254 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] [2021-12-14 16:52:41,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:52:41,568 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -839317713, now seen corresponding path program 1 times [2021-12-14 16:52:41,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:41,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931645606] [2021-12-14 16:52:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:41,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:52:41,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:41,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931645606] [2021-12-14 16:52:41,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931645606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:41,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:41,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:52:41,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108967547] [2021-12-14 16:52:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:41,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:52:41,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:52:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:52:41,657 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2021-12-14 16:52:41,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 200 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 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) [2021-12-14 16:52:41,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:41,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2021-12-14 16:52:41,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:41,848 INFO L129 PetriNetUnfolder]: 212/971 cut-off events. [2021-12-14 16:52:41,848 INFO L130 PetriNetUnfolder]: For 388/389 co-relation queries the response was YES. [2021-12-14 16:52:41,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 971 events. 212/971 cut-off events. For 388/389 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4744 event pairs, 98 based on Foata normal form. 12/882 useless extension candidates. Maximal degree in co-relation 1691. Up to 289 conditions per place. [2021-12-14 16:52:41,853 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 63 selfloop transitions, 11 changer transitions 0/230 dead transitions. [2021-12-14 16:52:41,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 230 transitions, 671 flow [2021-12-14 16:52:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:52:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:52:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1671 transitions. [2021-12-14 16:52:41,856 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8037518037518038 [2021-12-14 16:52:41,857 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1671 transitions. [2021-12-14 16:52:41,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1671 transitions. [2021-12-14 16:52:41,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:41,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1671 transitions. [2021-12-14 16:52:41,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,864 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:41,864 INFO L186 Difference]: Start difference. First operand has 203 places, 200 transitions, 442 flow. Second operand 9 states and 1671 transitions. [2021-12-14 16:52:41,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 230 transitions, 671 flow [2021-12-14 16:52:41,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 230 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:52:41,868 INFO L242 Difference]: Finished difference. Result has 212 places, 204 transitions, 482 flow [2021-12-14 16:52:41,868 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=212, PETRI_TRANSITIONS=204} [2021-12-14 16:52:41,870 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 3 predicate places. [2021-12-14 16:52:41,870 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 204 transitions, 482 flow [2021-12-14 16:52:41,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 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) [2021-12-14 16:52:41,871 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:41,871 INFO L254 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] [2021-12-14 16:52:41,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:52:41,871 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -537616131, now seen corresponding path program 1 times [2021-12-14 16:52:41,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:41,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331856286] [2021-12-14 16:52:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:41,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:52:41,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:41,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331856286] [2021-12-14 16:52:41,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331856286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:41,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:41,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:52:41,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906386160] [2021-12-14 16:52:41,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:41,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:52:41,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:41,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:52:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:52:41,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2021-12-14 16:52:41,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 204 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 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) [2021-12-14 16:52:41,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:41,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2021-12-14 16:52:41,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:42,153 INFO L129 PetriNetUnfolder]: 236/1235 cut-off events. [2021-12-14 16:52:42,154 INFO L130 PetriNetUnfolder]: For 512/514 co-relation queries the response was YES. [2021-12-14 16:52:42,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 1235 events. 236/1235 cut-off events. For 512/514 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6850 event pairs, 110 based on Foata normal form. 20/1127 useless extension candidates. Maximal degree in co-relation 2088. Up to 346 conditions per place. [2021-12-14 16:52:42,161 INFO L132 encePairwiseOnDemand]: 223/231 looper letters, 58 selfloop transitions, 8 changer transitions 0/222 dead transitions. [2021-12-14 16:52:42,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 672 flow [2021-12-14 16:52:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:52:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-14 16:52:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1303 transitions. [2021-12-14 16:52:42,163 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058132343846629 [2021-12-14 16:52:42,163 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1303 transitions. [2021-12-14 16:52:42,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1303 transitions. [2021-12-14 16:52:42,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:42,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1303 transitions. [2021-12-14 16:52:42,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 186.14285714285714) internal successors, (1303), 7 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:42,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:42,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:42,168 INFO L186 Difference]: Start difference. First operand has 212 places, 204 transitions, 482 flow. Second operand 7 states and 1303 transitions. [2021-12-14 16:52:42,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 672 flow [2021-12-14 16:52:42,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 222 transitions, 663 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-14 16:52:42,174 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 503 flow [2021-12-14 16:52:42,174 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2021-12-14 16:52:42,176 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 8 predicate places. [2021-12-14 16:52:42,176 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 503 flow [2021-12-14 16:52:42,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 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) [2021-12-14 16:52:42,177 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:42,177 INFO L254 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] [2021-12-14 16:52:42,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:52:42,177 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1312788725, now seen corresponding path program 1 times [2021-12-14 16:52:42,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:42,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461179370] [2021-12-14 16:52:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:42,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 16:52:42,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461179370] [2021-12-14 16:52:42,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461179370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:42,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:42,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:52:42,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875177710] [2021-12-14 16:52:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:42,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:52:42,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:52:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:52:42,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 231 [2021-12-14 16:52:42,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 503 flow. Second operand has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:42,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:42,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 231 [2021-12-14 16:52:42,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:44,991 INFO L129 PetriNetUnfolder]: 11619/21639 cut-off events. [2021-12-14 16:52:44,991 INFO L130 PetriNetUnfolder]: For 7570/7572 co-relation queries the response was YES. [2021-12-14 16:52:45,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44725 conditions, 21639 events. 11619/21639 cut-off events. For 7570/7572 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 190976 event pairs, 921 based on Foata normal form. 0/18710 useless extension candidates. Maximal degree in co-relation 44714. Up to 5635 conditions per place. [2021-12-14 16:52:45,102 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 184 selfloop transitions, 31 changer transitions 7/389 dead transitions. [2021-12-14 16:52:45,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 389 transitions, 1541 flow [2021-12-14 16:52:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:52:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-14 16:52:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2406 transitions. [2021-12-14 16:52:45,106 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8679653679653679 [2021-12-14 16:52:45,106 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2406 transitions. [2021-12-14 16:52:45,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2406 transitions. [2021-12-14 16:52:45,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:45,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2406 transitions. [2021-12-14 16:52:45,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 200.5) internal successors, (2406), 12 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:45,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 231.0) internal successors, (3003), 13 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:45,114 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 231.0) internal successors, (3003), 13 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:45,114 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 503 flow. Second operand 12 states and 2406 transitions. [2021-12-14 16:52:45,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 389 transitions, 1541 flow [2021-12-14 16:52:45,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 389 transitions, 1529 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-14 16:52:45,121 INFO L242 Difference]: Finished difference. Result has 232 places, 237 transitions, 722 flow [2021-12-14 16:52:45,121 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=722, PETRI_PLACES=232, PETRI_TRANSITIONS=237} [2021-12-14 16:52:45,122 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 23 predicate places. [2021-12-14 16:52:45,122 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 237 transitions, 722 flow [2021-12-14 16:52:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:45,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:45,123 INFO L254 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] [2021-12-14 16:52:45,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:52:45,123 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:45,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash 779654571, now seen corresponding path program 2 times [2021-12-14 16:52:45,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:45,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899983623] [2021-12-14 16:52:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:45,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 16:52:45,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899983623] [2021-12-14 16:52:45,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899983623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:45,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:45,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:52:45,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959853770] [2021-12-14 16:52:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:45,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:52:45,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:52:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:52:45,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2021-12-14 16:52:45,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 237 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:45,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:45,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2021-12-14 16:52:45,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:51,459 INFO L129 PetriNetUnfolder]: 27616/55978 cut-off events. [2021-12-14 16:52:51,459 INFO L130 PetriNetUnfolder]: For 79270/79484 co-relation queries the response was YES. [2021-12-14 16:52:51,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152202 conditions, 55978 events. 27616/55978 cut-off events. For 79270/79484 co-relation queries the response was YES. Maximal size of possible extension queue 2716. Compared 607244 event pairs, 3166 based on Foata normal form. 0/50000 useless extension candidates. Maximal degree in co-relation 152183. Up to 10694 conditions per place. [2021-12-14 16:52:52,334 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 275 selfloop transitions, 68 changer transitions 4/519 dead transitions. [2021-12-14 16:52:52,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 519 transitions, 2792 flow [2021-12-14 16:52:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:52:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:52:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2645 transitions. [2021-12-14 16:52:52,350 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807858807858808 [2021-12-14 16:52:52,351 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2645 transitions. [2021-12-14 16:52:52,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2645 transitions. [2021-12-14 16:52:52,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:52:52,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2645 transitions. [2021-12-14 16:52:52,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 203.46153846153845) internal successors, (2645), 13 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:52,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:52,376 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:52,376 INFO L186 Difference]: Start difference. First operand has 232 places, 237 transitions, 722 flow. Second operand 13 states and 2645 transitions. [2021-12-14 16:52:52,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 519 transitions, 2792 flow [2021-12-14 16:52:52,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 519 transitions, 2760 flow, removed 16 selfloop flow, removed 0 redundant places. [2021-12-14 16:52:52,437 INFO L242 Difference]: Finished difference. Result has 253 places, 300 transitions, 1261 flow [2021-12-14 16:52:52,437 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1261, PETRI_PLACES=253, PETRI_TRANSITIONS=300} [2021-12-14 16:52:52,439 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 44 predicate places. [2021-12-14 16:52:52,439 INFO L470 AbstractCegarLoop]: Abstraction has has 253 places, 300 transitions, 1261 flow [2021-12-14 16:52:52,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:52,440 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:52:52,440 INFO L254 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] [2021-12-14 16:52:52,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:52:52,440 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:52:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:52:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1167519643, now seen corresponding path program 3 times [2021-12-14 16:52:52,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:52:52,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389561780] [2021-12-14 16:52:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:52:52,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:52:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:52:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 16:52:52,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:52:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389561780] [2021-12-14 16:52:52,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389561780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:52:52,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:52:52,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:52:52,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631780903] [2021-12-14 16:52:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:52:52,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:52:52,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:52:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:52:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:52:52,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2021-12-14 16:52:52,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 300 transitions, 1261 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:52:52,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:52:52,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2021-12-14 16:52:52,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:52:59,742 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 148#L56true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:52:59,743 INFO L384 tUnfolder$Statistics]: this new event has 164 ancestors and is cut-off event [2021-12-14 16:52:59,743 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:52:59,743 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:52:59,743 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:52:59,949 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 150#L59true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 89#L145-4true, Black: 252#(<= ~q2_back~0 ~q2_front~0)]) [2021-12-14 16:52:59,950 INFO L384 tUnfolder$Statistics]: this new event has 165 ancestors and is cut-off event [2021-12-14 16:52:59,950 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2021-12-14 16:52:59,950 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2021-12-14 16:52:59,950 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,107 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 34#L98true, 140#L62true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 89#L145-4true, Black: 252#(<= ~q2_back~0 ~q2_front~0)]) [2021-12-14 16:53:00,108 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,108 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2021-12-14 16:53:00,108 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,108 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2021-12-14 16:53:00,109 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 148#L56true, 191#L112true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,109 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,109 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,109 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,109 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 148#L56true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,110 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,110 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,110 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,111 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,242 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), 103#L51-1true, Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,243 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2021-12-14 16:53:00,243 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,243 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,243 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [139#L52true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,244 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2021-12-14 16:53:00,244 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,245 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2021-12-14 16:53:00,245 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,245 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 191#L112true, 150#L59true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,246 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2021-12-14 16:53:00,246 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,246 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,246 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,247 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 150#L59true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,247 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2021-12-14 16:53:00,247 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,247 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,247 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2021-12-14 16:53:00,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 191#L112true, 34#L98true, 140#L62true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,460 INFO L384 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2021-12-14 16:53:00,460 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,460 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,460 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,461 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 34#L98true, 140#L62true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,461 INFO L384 tUnfolder$Statistics]: this new event has 168 ancestors and is cut-off event [2021-12-14 16:53:00,461 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,461 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,461 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2021-12-14 16:53:00,515 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), 103#L51-1true, Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 191#L112true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,515 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,516 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,516 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,516 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,516 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), 103#L51-1true, Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,516 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,517 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,517 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,517 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,517 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [139#L52true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 191#L112true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,517 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,517 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,518 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,518 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,518 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [139#L52true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), 89#L145-4true]) [2021-12-14 16:53:00,518 INFO L384 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,518 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,518 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,519 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2021-12-14 16:53:00,647 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [201#L146-2true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), 85#L116true, Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 294#(< ~j~0 ~N~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0)]) [2021-12-14 16:53:00,647 INFO L384 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2021-12-14 16:53:00,647 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,647 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2021-12-14 16:53:00,648 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2021-12-14 16:53:00,674 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [201#L146-2true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 317#true, Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 6#L72-1true, 191#L112true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0)]) [2021-12-14 16:53:00,675 INFO L384 tUnfolder$Statistics]: this new event has 175 ancestors and is cut-off event [2021-12-14 16:53:00,675 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,675 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,675 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([849] L94-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_69| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* v_~q1_front~0_47 4)))) (not (= (ite (and (< v_~q1_front~0_47 v_~q1_back~0_52) (< v_~q1_front~0_47 v_~n1~0_20) (<= 0 v_~q1_front~0_47)) 1 0) 0)) (= v_~total~0_69 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= (+ v_~q1_front~0_47 1) v_~q1_front~0_46) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_1| 2147483648)) (= v_~total~0_70 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_47, ~q1_back~0=v_~q1_back~0_52, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, ~total~0=v_~total~0_70} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_46, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_1|, ~total~0=v_~total~0_69, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_1|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_1|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_52, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_69|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][247], [201#L146-2true, 229#true, 348#true, Black: 260#(<= ~n1~0 0), Black: 264#(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|)), 317#true, Black: 329#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 337#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 322#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 323#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 335#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 320#(and (= ~j~0 0) (= ~i~0 0)), Black: 325#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), Black: 331#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 333#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 287#true, 75#L111-1true, 6#L72-1true, 34#L98true, Black: 234#(= ~total~0 0), Black: 297#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 299#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~i~0 ~N~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~j~0 ~N~0))), Black: 303#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 301#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (< ~j~0 ~N~0)), Black: 294#(< ~j~0 ~N~0), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 305#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0)), Black: 307#(and (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 295#(and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0)]) [2021-12-14 16:53:00,676 INFO L384 tUnfolder$Statistics]: this new event has 175 ancestors and is cut-off event [2021-12-14 16:53:00,676 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,676 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,676 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2021-12-14 16:53:00,745 INFO L129 PetriNetUnfolder]: 30379/60546 cut-off events. [2021-12-14 16:53:00,746 INFO L130 PetriNetUnfolder]: For 125964/126178 co-relation queries the response was YES. [2021-12-14 16:53:01,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188731 conditions, 60546 events. 30379/60546 cut-off events. For 125964/126178 co-relation queries the response was YES. Maximal size of possible extension queue 2993. Compared 653690 event pairs, 6763 based on Foata normal form. 88/58235 useless extension candidates. Maximal degree in co-relation 188702. Up to 24707 conditions per place. [2021-12-14 16:53:01,458 INFO L132 encePairwiseOnDemand]: 220/231 looper letters, 198 selfloop transitions, 91 changer transitions 13/474 dead transitions. [2021-12-14 16:53:01,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 474 transitions, 2894 flow [2021-12-14 16:53:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:53:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:53:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2026 transitions. [2021-12-14 16:53:01,467 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8770562770562771 [2021-12-14 16:53:01,467 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2026 transitions. [2021-12-14 16:53:01,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2026 transitions. [2021-12-14 16:53:01,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:53:01,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2026 transitions. [2021-12-14 16:53:01,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 202.6) internal successors, (2026), 10 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:01,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:01,569 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:01,569 INFO L186 Difference]: Start difference. First operand has 253 places, 300 transitions, 1261 flow. Second operand 10 states and 2026 transitions. [2021-12-14 16:53:01,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 474 transitions, 2894 flow [2021-12-14 16:53:02,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 474 transitions, 2892 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-12-14 16:53:02,570 INFO L242 Difference]: Finished difference. Result has 269 places, 350 transitions, 1991 flow [2021-12-14 16:53:02,571 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1991, PETRI_PLACES=269, PETRI_TRANSITIONS=350} [2021-12-14 16:53:02,572 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 60 predicate places. [2021-12-14 16:53:02,572 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 350 transitions, 1991 flow [2021-12-14 16:53:02,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:02,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:53:02,573 INFO L254 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] [2021-12-14 16:53:02,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:53:02,573 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:53:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:53:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1149346007, now seen corresponding path program 4 times [2021-12-14 16:53:02,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:53:02,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61206069] [2021-12-14 16:53:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:53:02,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:53:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:53:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:53:02,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:53:02,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61206069] [2021-12-14 16:53:02,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61206069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:53:02,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:53:02,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:53:02,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733732416] [2021-12-14 16:53:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:53:02,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:53:02,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:53:02,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:53:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:53:02,740 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2021-12-14 16:53:02,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 350 transitions, 1991 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:02,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:53:02,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2021-12-14 16:53:02,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:53:12,613 INFO L129 PetriNetUnfolder]: 34271/71024 cut-off events. [2021-12-14 16:53:12,613 INFO L130 PetriNetUnfolder]: For 190092/190925 co-relation queries the response was YES. [2021-12-14 16:53:13,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237675 conditions, 71024 events. 34271/71024 cut-off events. For 190092/190925 co-relation queries the response was YES. Maximal size of possible extension queue 3413. Compared 812807 event pairs, 7257 based on Foata normal form. 945/70302 useless extension candidates. Maximal degree in co-relation 237638. Up to 23561 conditions per place. [2021-12-14 16:53:13,812 INFO L132 encePairwiseOnDemand]: 223/231 looper letters, 204 selfloop transitions, 176 changer transitions 3/559 dead transitions. [2021-12-14 16:53:13,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 559 transitions, 4430 flow [2021-12-14 16:53:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 16:53:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-14 16:53:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1627 transitions. [2021-12-14 16:53:13,815 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8804112554112554 [2021-12-14 16:53:13,815 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1627 transitions. [2021-12-14 16:53:13,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1627 transitions. [2021-12-14 16:53:13,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:53:13,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1627 transitions. [2021-12-14 16:53:13,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 203.375) internal successors, (1627), 8 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:13,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:13,821 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:13,821 INFO L186 Difference]: Start difference. First operand has 269 places, 350 transitions, 1991 flow. Second operand 8 states and 1627 transitions. [2021-12-14 16:53:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 559 transitions, 4430 flow [2021-12-14 16:53:16,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 559 transitions, 4364 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-12-14 16:53:16,036 INFO L242 Difference]: Finished difference. Result has 278 places, 443 transitions, 3513 flow [2021-12-14 16:53:16,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3513, PETRI_PLACES=278, PETRI_TRANSITIONS=443} [2021-12-14 16:53:16,037 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 69 predicate places. [2021-12-14 16:53:16,037 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 443 transitions, 3513 flow [2021-12-14 16:53:16,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:16,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:53:16,038 INFO L254 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] [2021-12-14 16:53:16,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:53:16,038 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-14 16:53:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:53:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2045278667, now seen corresponding path program 5 times [2021-12-14 16:53:16,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:53:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934193022] [2021-12-14 16:53:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:53:16,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:53:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:53:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 16:53:16,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:53:16,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934193022] [2021-12-14 16:53:16,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934193022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:53:16,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:53:16,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:53:16,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638237219] [2021-12-14 16:53:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:53:16,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:53:16,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:53:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:53:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:53:16,315 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2021-12-14 16:53:16,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 443 transitions, 3513 flow. Second operand has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:16,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:53:16,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2021-12-14 16:53:16,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:53:28,444 INFO L129 PetriNetUnfolder]: 37729/80281 cut-off events. [2021-12-14 16:53:28,445 INFO L130 PetriNetUnfolder]: For 262220/263310 co-relation queries the response was YES. [2021-12-14 16:53:29,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280057 conditions, 80281 events. 37729/80281 cut-off events. For 262220/263310 co-relation queries the response was YES. Maximal size of possible extension queue 3779. Compared 952489 event pairs, 10403 based on Foata normal form. 575/78865 useless extension candidates. Maximal degree in co-relation 280017. Up to 31870 conditions per place. [2021-12-14 16:53:29,682 INFO L132 encePairwiseOnDemand]: 220/231 looper letters, 222 selfloop transitions, 273 changer transitions 40/711 dead transitions. [2021-12-14 16:53:29,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 711 transitions, 7220 flow [2021-12-14 16:53:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:53:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:53:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2026 transitions. [2021-12-14 16:53:29,703 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8770562770562771 [2021-12-14 16:53:29,704 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2026 transitions. [2021-12-14 16:53:29,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2026 transitions. [2021-12-14 16:53:29,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:53:29,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2026 transitions. [2021-12-14 16:53:29,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 202.6) internal successors, (2026), 10 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:29,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:29,720 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:53:29,721 INFO L186 Difference]: Start difference. First operand has 278 places, 443 transitions, 3513 flow. Second operand 10 states and 2026 transitions. [2021-12-14 16:53:29,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 711 transitions, 7220 flow