./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G --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 f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:57:50,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:57:50,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:57:50,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:57:50,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:57:50,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:57:50,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:57:50,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:57:50,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:57:50,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:57:50,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:57:50,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:57:50,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:57:50,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:57:50,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:57:50,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:57:50,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:57:50,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:57:50,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:57:50,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:57:50,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:57:50,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:57:50,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:57:50,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:57:50,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:57:50,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:57:50,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:57:50,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:57:50,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:57:50,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:57:50,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:57:50,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:57:50,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:57:50,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:57:50,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:57:50,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:57:50,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:57:50,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:57:50,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:57:50,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:57:50,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:57:50,975 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:57:51,017 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:57:51,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:57:51,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:57:51,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:57:51,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:57:51,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:57:51,031 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:57:51,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:57:51,031 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:57:51,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:57:51,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:57:51,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:57:51,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:57:51,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:57:51,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:57:51,034 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:57:51,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:57:51,034 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:57:51,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:57:51,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:57:51,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:57:51,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:57:51,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:57:51,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:57:51,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:57:51,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:57:51,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:57:51,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:57:51,037 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:57:51,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:57:51,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:57:51,039 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:57:51,039 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G 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 -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2021-11-23 13:57:51,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:57:51,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:57:51,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:57:51,378 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:57:51,379 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:57:51,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-11-23 13:57:51,469 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/data/51330c366/9d880234ffe74c8799aa939d6b3f620b/FLAGbfcc14fcf [2021-11-23 13:57:51,955 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:57:51,955 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-11-23 13:57:51,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/data/51330c366/9d880234ffe74c8799aa939d6b3f620b/FLAGbfcc14fcf [2021-11-23 13:57:52,348 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/data/51330c366/9d880234ffe74c8799aa939d6b3f620b [2021-11-23 13:57:52,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:57:52,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:57:52,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:57:52,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:57:52,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:57:52,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b70756e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52, skipping insertion in model container [2021-11-23 13:57:52,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:57:52,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:57:52,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-11-23 13:57:52,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:57:52,671 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:57:52,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-11-23 13:57:52,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:57:52,719 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:57:52,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52 WrapperNode [2021-11-23 13:57:52,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:57:52,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:57:52,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:57:52,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:57:52,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,778 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2021-11-23 13:57:52,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:57:52,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:57:52,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:57:52,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:57:52,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:57:52,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:57:52,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:57:52,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:57:52,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (1/1) ... [2021-11-23 13:57:52,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:57:52,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:57:52,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:57:52,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:57:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:57:52,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 13:57:52,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 13:57:52,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 13:57:52,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-23 13:57:52,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-23 13:57:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-23 13:57:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-23 13:57:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-23 13:57:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-23 13:57:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-23 13:57:52,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-23 13:57:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:57:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-23 13:57:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-23 13:57:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 13:57:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:57:52,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:57:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 13:57:52,961 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-23 13:57:53,136 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:57:53,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:57:53,733 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:57:54,017 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:57:54,023 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-23 13:57:54,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:57:54 BoogieIcfgContainer [2021-11-23 13:57:54,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:57:54,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:57:54,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:57:54,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:57:54,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:57:52" (1/3) ... [2021-11-23 13:57:54,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78662bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:57:54, skipping insertion in model container [2021-11-23 13:57:54,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:52" (2/3) ... [2021-11-23 13:57:54,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78662bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:57:54, skipping insertion in model container [2021-11-23 13:57:54,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:57:54" (3/3) ... [2021-11-23 13:57:54,038 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2021-11-23 13:57:54,044 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-23 13:57:54,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:57:54,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:57:54,044 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-23 13:57:54,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,147 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,148 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,148 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,148 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,149 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,149 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,155 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,156 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,159 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,159 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,160 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,160 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,161 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,162 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,163 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,163 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,164 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,171 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,171 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,173 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,174 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,174 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,174 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,174 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,174 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,175 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,176 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,182 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,182 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,182 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,183 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,183 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,183 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,183 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,183 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,184 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,184 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,184 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,184 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,184 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,190 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,190 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,191 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,191 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,191 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,191 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,195 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,195 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,195 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,195 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,195 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,196 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:57:54,200 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-11-23 13:57:54,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:57:54,273 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-11-23 13:57:54,274 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-23 13:57:54,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2021-11-23 13:57:54,392 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2021-11-23 13:57:54,392 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-23 13:57:54,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2021-11-23 13:57:54,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2021-11-23 13:57:54,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2021-11-23 13:57:54,491 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2021-11-23 13:57:54,503 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-23 13:57:54,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:54,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:54,505 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-11-23 13:57:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2021-11-23 13:57:54,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:54,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526547183] [2021-11-23 13:57:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:54,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:57:54,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526547183] [2021-11-23 13:57:54,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526547183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:54,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:54,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:57:54,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711814116] [2021-11-23 13:57:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:55,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 13:57:55,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:55,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 13:57:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 13:57:55,048 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2021-11-23 13:57:55,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 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-11-23 13:57:55,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:55,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2021-11-23 13:57:55,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:55,306 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2021-11-23 13:57:55,306 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2021-11-23 13:57:55,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1720 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-11-23 13:57:55,318 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2021-11-23 13:57:55,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2021-11-23 13:57:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 13:57:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-11-23 13:57:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2021-11-23 13:57:55,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2021-11-23 13:57:55,346 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2021-11-23 13:57:55,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2021-11-23 13:57:55,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:55,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2021-11-23 13:57:55,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 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-11-23 13:57:55,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-11-23 13:57:55,370 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 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-11-23 13:57:55,373 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2021-11-23 13:57:55,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2021-11-23 13:57:55,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-11-23 13:57:55,390 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2021-11-23 13:57:55,393 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2021-11-23 13:57:55,398 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2021-11-23 13:57:55,399 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2021-11-23 13:57:55,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 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-11-23 13:57:55,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:55,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:55,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:57:55,401 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-11-23 13:57:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2021-11-23 13:57:55,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:55,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975437061] [2021-11-23 13:57:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:55,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:57:55,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975437061] [2021-11-23 13:57:55,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975437061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:55,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:55,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:57:55,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159479097] [2021-11-23 13:57:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:55,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:57:55,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:57:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:57:55,858 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2021-11-23 13:57:55,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-11-23 13:57:55,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:55,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2021-11-23 13:57:55,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:56,097 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2021-11-23 13:57:56,097 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-11-23 13:57:56,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1675 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2021-11-23 13:57:56,107 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2021-11-23 13:57:56,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2021-11-23 13:57:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:57:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-23 13:57:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2021-11-23 13:57:56,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2021-11-23 13:57:56,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2021-11-23 13:57:56,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2021-11-23 13:57:56,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:56,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2021-11-23 13:57:56,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:57:56,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-11-23 13:57:56,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 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-11-23 13:57:56,125 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2021-11-23 13:57:56,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2021-11-23 13:57:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-23 13:57:56,141 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2021-11-23 13:57:56,142 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2021-11-23 13:57:56,143 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-11-23 13:57:56,143 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2021-11-23 13:57:56,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-11-23 13:57:56,144 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:56,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:56,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:57:56,145 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-11-23 13:57:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2021-11-23 13:57:56,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:56,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340546893] [2021-11-23 13:57:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:56,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:57:56,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340546893] [2021-11-23 13:57:56,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340546893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:56,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:56,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:57:56,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815948299] [2021-11-23 13:57:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:56,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:57:56,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:57:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:57:56,321 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-11-23 13:57:56,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-23 13:57:56,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:56,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-11-23 13:57:56,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:56,574 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2021-11-23 13:57:56,575 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2021-11-23 13:57:56,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3026 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2021-11-23 13:57:56,583 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2021-11-23 13:57:56,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2021-11-23 13:57:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:57:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:57:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2021-11-23 13:57:56,586 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2021-11-23 13:57:56,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2021-11-23 13:57:56,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2021-11-23 13:57:56,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:56,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2021-11-23 13:57:56,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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-11-23 13:57:56,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-11-23 13:57:56,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-11-23 13:57:56,593 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2021-11-23 13:57:56,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2021-11-23 13:57:56,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-11-23 13:57:56,601 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2021-11-23 13:57:56,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2021-11-23 13:57:56,604 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2021-11-23 13:57:56,604 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2021-11-23 13:57:56,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-23 13:57:56,605 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:56,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:56,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:57:56,606 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-11-23 13:57:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2021-11-23 13:57:56,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:56,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733215639] [2021-11-23 13:57:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:56,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:57:56,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:56,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733215639] [2021-11-23 13:57:56,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733215639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:56,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:56,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:57:56,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578353249] [2021-11-23 13:57:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:56,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:57:56,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:57:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:57:56,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-11-23 13:57:56,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-23 13:57:56,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:56,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-11-23 13:57:56,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:56,981 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2021-11-23 13:57:56,981 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2021-11-23 13:57:56,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2788 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2021-11-23 13:57:56,989 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2021-11-23 13:57:56,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2021-11-23 13:57:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:57:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:57:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2021-11-23 13:57:56,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2021-11-23 13:57:56,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2021-11-23 13:57:56,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2021-11-23 13:57:56,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:56,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2021-11-23 13:57:56,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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-11-23 13:57:56,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-11-23 13:57:57,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-11-23 13:57:57,001 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2021-11-23 13:57:57,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2021-11-23 13:57:57,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-23 13:57:57,008 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2021-11-23 13:57:57,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2021-11-23 13:57:57,011 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-11-23 13:57:57,011 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2021-11-23 13:57:57,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-11-23 13:57:57,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:57,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:57,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:57:57,013 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-11-23 13:57:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2021-11-23 13:57:57,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000228748] [2021-11-23 13:57:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:57,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:57:57,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000228748] [2021-11-23 13:57:57,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000228748] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:57,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:57,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:57:57,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908386122] [2021-11-23 13:57:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:57,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:57:57,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:57:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:57:57,178 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-11-23 13:57:57,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-11-23 13:57:57,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:57,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-11-23 13:57:57,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:57,535 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2021-11-23 13:57:57,536 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2021-11-23 13:57:57,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2942 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2021-11-23 13:57:57,562 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2021-11-23 13:57:57,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2021-11-23 13:57:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:57:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:57:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2021-11-23 13:57:57,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2021-11-23 13:57:57,569 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2021-11-23 13:57:57,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2021-11-23 13:57:57,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:57,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2021-11-23 13:57:57,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 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-11-23 13:57:57,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:57:57,588 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:57:57,589 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2021-11-23 13:57:57,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2021-11-23 13:57:57,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-23 13:57:57,599 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2021-11-23 13:57:57,600 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2021-11-23 13:57:57,602 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2021-11-23 13:57:57,602 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2021-11-23 13:57:57,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-11-23 13:57:57,604 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:57,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:57,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:57:57,605 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-11-23 13:57:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2021-11-23 13:57:57,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600050703] [2021-11-23 13:57:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:57,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 13:57:57,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:57,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600050703] [2021-11-23 13:57:57,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600050703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:57,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:57,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:57:57,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482074422] [2021-11-23 13:57:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:57,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:57:57,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:57:57,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:57:57,735 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-11-23 13:57:57,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-11-23 13:57:57,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:57,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-11-23 13:57:57,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:57:58,087 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2021-11-23 13:57:58,087 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2021-11-23 13:57:58,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4977 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2021-11-23 13:57:58,098 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2021-11-23 13:57:58,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2021-11-23 13:57:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:57:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:57:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2021-11-23 13:57:58,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2021-11-23 13:57:58,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2021-11-23 13:57:58,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2021-11-23 13:57:58,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:57:58,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2021-11-23 13:57:58,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 0 states have call successors, (0), 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-11-23 13:57:58,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:57:58,121 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:57:58,122 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2021-11-23 13:57:58,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2021-11-23 13:57:58,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-23 13:57:58,157 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2021-11-23 13:57:58,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2021-11-23 13:57:58,158 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2021-11-23 13:57:58,158 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2021-11-23 13:57:58,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 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-11-23 13:57:58,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:57:58,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:57:58,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:57:58,160 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-11-23 13:57:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:57:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2021-11-23 13:57:58,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:57:58,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390815609] [2021-11-23 13:57:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:57:58,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:57:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:57:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:57:58,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:57:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390815609] [2021-11-23 13:57:58,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390815609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:57:58,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:57:58,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:57:58,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214989192] [2021-11-23 13:57:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:57:58,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:57:58,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:57:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:57:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:57:58,402 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-11-23 13:57:58,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-11-23 13:57:58,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:57:58,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-11-23 13:57:58,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:00,842 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2021-11-23 13:58:00,842 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2021-11-23 13:58:00,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87639 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2021-11-23 13:58:00,958 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2021-11-23 13:58:00,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2021-11-23 13:58:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:58:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:58:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2021-11-23 13:58:00,966 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2021-11-23 13:58:00,967 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2021-11-23 13:58:00,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2021-11-23 13:58:00,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:00,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2021-11-23 13:58:00,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 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-11-23 13:58:00,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:00,985 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:00,985 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2021-11-23 13:58:00,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2021-11-23 13:58:00,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-23 13:58:00,997 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2021-11-23 13:58:00,998 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2021-11-23 13:58:00,999 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2021-11-23 13:58:00,999 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2021-11-23 13:58:01,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-11-23 13:58:01,001 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:01,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:58:01,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:58:01,002 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-11-23 13:58:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2021-11-23 13:58:01,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:01,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257614932] [2021-11-23 13:58:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:01,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:01,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-11-23 13:58:01,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257614932] [2021-11-23 13:58:01,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257614932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:58:01,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:58:01,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:58:01,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959033492] [2021-11-23 13:58:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:01,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:58:01,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:58:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:58:01,281 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-11-23 13:58:01,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-11-23 13:58:01,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:01,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-11-23 13:58:01,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:03,296 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2021-11-23 13:58:03,297 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2021-11-23 13:58:03,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2888/2926 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 63264 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2021-11-23 13:58:03,380 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2021-11-23 13:58:03,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2021-11-23 13:58:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:58:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:58:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2021-11-23 13:58:03,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2021-11-23 13:58:03,389 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2021-11-23 13:58:03,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2021-11-23 13:58:03,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:03,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2021-11-23 13:58:03,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 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-11-23 13:58:03,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:03,408 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:03,409 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2021-11-23 13:58:03,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2021-11-23 13:58:03,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-23 13:58:03,428 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2021-11-23 13:58:03,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2021-11-23 13:58:03,434 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2021-11-23 13:58:03,434 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2021-11-23 13:58:03,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 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-11-23 13:58:03,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:03,436 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, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:03,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:58:03,437 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-11-23 13:58:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2021-11-23 13:58:03,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:03,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306927394] [2021-11-23 13:58:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:03,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:58:03,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306927394] [2021-11-23 13:58:03,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306927394] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727567305] [2021-11-23 13:58:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:03,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:58:03,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:58:03,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 13:58:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:03,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 13:58:04,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:58:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 13:58:04,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:58:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:58:05,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727567305] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:05,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:58:05,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2021-11-23 13:58:05,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389253271] [2021-11-23 13:58:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:05,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:58:05,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:58:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-23 13:58:05,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2021-11-23 13:58:05,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-11-23 13:58:05,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:05,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2021-11-23 13:58:05,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:07,394 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2021-11-23 13:58:07,394 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2021-11-23 13:58:07,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 6652 events. 3111/6652 cut-off events. For 3365/3381 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 46322 event pairs, 179 based on Foata normal form. 200/6442 useless extension candidates. Maximal degree in co-relation 14575. Up to 885 conditions per place. [2021-11-23 13:58:07,483 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2021-11-23 13:58:07,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2021-11-23 13:58:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 13:58:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-11-23 13:58:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2021-11-23 13:58:07,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2021-11-23 13:58:07,495 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2021-11-23 13:58:07,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2021-11-23 13:58:07,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:07,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2021-11-23 13:58:07,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.1) internal successors, (3802), 20 states have internal predecessors, (3802), 0 states have call successors, (0), 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-11-23 13:58:07,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 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-11-23 13:58:07,520 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 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-11-23 13:58:07,521 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2021-11-23 13:58:07,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2021-11-23 13:58:07,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 355 transitions, 1335 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-11-23 13:58:07,546 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2021-11-23 13:58:07,547 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=790, PETRI_PLACES=276, PETRI_TRANSITIONS=256} [2021-11-23 13:58:07,548 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2021-11-23 13:58:07,548 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2021-11-23 13:58:07,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 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-11-23 13:58:07,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:07,550 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, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:07,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 13:58:07,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:07,764 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-11-23 13:58:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2021-11-23 13:58:07,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:07,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431640896] [2021-11-23 13:58:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:07,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:58:08,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431640896] [2021-11-23 13:58:08,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431640896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:58:08,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:58:08,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:58:08,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892683059] [2021-11-23 13:58:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:08,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:58:08,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:58:08,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:58:08,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-11-23 13:58:08,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 256 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 192.3) internal successors, (1923), 10 states have internal predecessors, (1923), 0 states have call successors, (0), 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-11-23 13:58:08,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:08,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-11-23 13:58:08,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:09,331 INFO L129 PetriNetUnfolder]: 2524/4881 cut-off events. [2021-11-23 13:58:09,332 INFO L130 PetriNetUnfolder]: For 7142/7150 co-relation queries the response was YES. [2021-11-23 13:58:09,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13156 conditions, 4881 events. 2524/4881 cut-off events. For 7142/7150 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 32402 event pairs, 238 based on Foata normal form. 8/4544 useless extension candidates. Maximal degree in co-relation 13134. Up to 2051 conditions per place. [2021-11-23 13:58:09,393 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 113 selfloop transitions, 11 changer transitions 3/297 dead transitions. [2021-11-23 13:58:09,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 297 transitions, 1218 flow [2021-11-23 13:58:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:58:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:58:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2021-11-23 13:58:09,400 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7471698113207547 [2021-11-23 13:58:09,400 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2021-11-23 13:58:09,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2021-11-23 13:58:09,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:09,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2021-11-23 13:58:09,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 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-11-23 13:58:09,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:09,413 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:09,413 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1782 transitions. [2021-11-23 13:58:09,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 297 transitions, 1218 flow [2021-11-23 13:58:09,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 297 transitions, 1157 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-11-23 13:58:09,456 INFO L242 Difference]: Finished difference. Result has 274 places, 254 transitions, 763 flow [2021-11-23 13:58:09,456 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=274, PETRI_TRANSITIONS=254} [2021-11-23 13:58:09,457 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 35 predicate places. [2021-11-23 13:58:09,457 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 254 transitions, 763 flow [2021-11-23 13:58:09,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 192.3) internal successors, (1923), 10 states have internal predecessors, (1923), 0 states have call successors, (0), 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-11-23 13:58:09,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:09,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:09,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:58:09,459 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-11-23 13:58:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1816174413, now seen corresponding path program 1 times [2021-11-23 13:58:09,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:09,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073772097] [2021-11-23 13:58:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:09,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:09,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:09,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073772097] [2021-11-23 13:58:09,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073772097] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:09,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72244433] [2021-11-23 13:58:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:09,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:58:09,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:58:09,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 13:58:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:09,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 13:58:09,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:58:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:10,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:58:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:11,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72244433] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:11,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:58:11,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 9] total 23 [2021-11-23 13:58:11,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357072494] [2021-11-23 13:58:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:11,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:58:11,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:58:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-11-23 13:58:11,233 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2021-11-23 13:58:11,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 254 transitions, 763 flow. Second operand has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 0 states have call successors, (0), 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-11-23 13:58:11,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:11,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2021-11-23 13:58:11,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:12,949 INFO L129 PetriNetUnfolder]: 4647/8628 cut-off events. [2021-11-23 13:58:12,949 INFO L130 PetriNetUnfolder]: For 17777/17777 co-relation queries the response was YES. [2021-11-23 13:58:13,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24759 conditions, 8628 events. 4647/8628 cut-off events. For 17777/17777 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 63352 event pairs, 1133 based on Foata normal form. 228/8210 useless extension candidates. Maximal degree in co-relation 24735. Up to 2924 conditions per place. [2021-11-23 13:58:13,083 INFO L132 encePairwiseOnDemand]: 247/265 looper letters, 140 selfloop transitions, 37 changer transitions 0/337 dead transitions. [2021-11-23 13:58:13,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 337 transitions, 1520 flow [2021-11-23 13:58:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 13:58:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-23 13:58:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2850 transitions. [2021-11-23 13:58:13,094 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7169811320754716 [2021-11-23 13:58:13,095 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2850 transitions. [2021-11-23 13:58:13,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2850 transitions. [2021-11-23 13:58:13,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:13,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2850 transitions. [2021-11-23 13:58:13,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 190.0) internal successors, (2850), 15 states have internal predecessors, (2850), 0 states have call successors, (0), 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-11-23 13:58:13,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 265.0) internal successors, (4240), 16 states have internal predecessors, (4240), 0 states have call successors, (0), 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-11-23 13:58:13,117 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 265.0) internal successors, (4240), 16 states have internal predecessors, (4240), 0 states have call successors, (0), 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-11-23 13:58:13,117 INFO L186 Difference]: Start difference. First operand has 274 places, 254 transitions, 763 flow. Second operand 15 states and 2850 transitions. [2021-11-23 13:58:13,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 337 transitions, 1520 flow [2021-11-23 13:58:13,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 337 transitions, 1444 flow, removed 8 selfloop flow, removed 12 redundant places. [2021-11-23 13:58:13,190 INFO L242 Difference]: Finished difference. Result has 279 places, 274 transitions, 1004 flow [2021-11-23 13:58:13,191 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1004, PETRI_PLACES=279, PETRI_TRANSITIONS=274} [2021-11-23 13:58:13,191 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 40 predicate places. [2021-11-23 13:58:13,192 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 274 transitions, 1004 flow [2021-11-23 13:58:13,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 0 states have call successors, (0), 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-11-23 13:58:13,192 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:13,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:13,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 13:58:13,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 13:58:13,417 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-23 13:58:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash 395722677, now seen corresponding path program 2 times [2021-11-23 13:58:13,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:13,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227427837] [2021-11-23 13:58:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:13,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 13:58:13,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:13,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227427837] [2021-11-23 13:58:13,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227427837] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:13,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462792407] [2021-11-23 13:58:13,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:58:13,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:58:13,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:58:13,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 13:58:13,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 13:58:13,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:58:13,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:58:13,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:58:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 13:58:14,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:58:14,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462792407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:58:14,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 13:58:14,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2021-11-23 13:58:14,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175568508] [2021-11-23 13:58:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:14,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:58:14,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:58:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:58:14,299 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2021-11-23 13:58:14,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 274 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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-11-23 13:58:14,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:14,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2021-11-23 13:58:14,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:16,789 INFO L129 PetriNetUnfolder]: 5146/11133 cut-off events. [2021-11-23 13:58:16,789 INFO L130 PetriNetUnfolder]: For 54129/54698 co-relation queries the response was YES. [2021-11-23 13:58:16,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40630 conditions, 11133 events. 5146/11133 cut-off events. For 54129/54698 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 101490 event pairs, 543 based on Foata normal form. 298/10839 useless extension candidates. Maximal degree in co-relation 40605. Up to 2428 conditions per place. [2021-11-23 13:58:16,995 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 158 selfloop transitions, 56 changer transitions 0/423 dead transitions. [2021-11-23 13:58:16,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 423 transitions, 2520 flow [2021-11-23 13:58:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 13:58:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-23 13:58:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1868 transitions. [2021-11-23 13:58:17,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8811320754716981 [2021-11-23 13:58:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1868 transitions. [2021-11-23 13:58:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1868 transitions. [2021-11-23 13:58:17,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:17,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1868 transitions. [2021-11-23 13:58:17,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 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-11-23 13:58:17,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-11-23 13:58:17,022 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 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-11-23 13:58:17,022 INFO L186 Difference]: Start difference. First operand has 279 places, 274 transitions, 1004 flow. Second operand 8 states and 1868 transitions. [2021-11-23 13:58:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 423 transitions, 2520 flow [2021-11-23 13:58:17,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 423 transitions, 2464 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-11-23 13:58:17,184 INFO L242 Difference]: Finished difference. Result has 284 places, 319 transitions, 1647 flow [2021-11-23 13:58:17,185 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1647, PETRI_PLACES=284, PETRI_TRANSITIONS=319} [2021-11-23 13:58:17,186 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 45 predicate places. [2021-11-23 13:58:17,187 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 319 transitions, 1647 flow [2021-11-23 13:58:17,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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-11-23 13:58:17,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:17,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:17,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 13:58:17,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 13:58:17,403 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-23 13:58:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1322156743, now seen corresponding path program 1 times [2021-11-23 13:58:17,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:17,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618976925] [2021-11-23 13:58:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:17,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618976925] [2021-11-23 13:58:17,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618976925] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:17,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088813353] [2021-11-23 13:58:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:17,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:58:17,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:58:17,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 13:58:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:17,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:58:17,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:58:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:18,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:58:18,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088813353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:58:18,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 13:58:18,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-11-23 13:58:18,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376247040] [2021-11-23 13:58:18,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:18,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:58:18,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:18,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:58:18,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:58:18,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2021-11-23 13:58:18,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 319 transitions, 1647 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-11-23 13:58:18,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:18,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2021-11-23 13:58:18,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:20,474 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:20,475 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:20,475 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:20,475 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:20,475 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:20,475 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:20,476 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:20,476 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:20,476 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:20,476 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:20,888 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 115#L51-1true, 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 176#L97true, Black: 311#(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|)), 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2021-11-23 13:58:20,889 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,889 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:20,889 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,889 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:20,911 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][290], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:20,911 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,911 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:20,911 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:20,911 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,932 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:20,933 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:20,933 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:20,934 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,012 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][315], [24#L115true, 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 17#L58true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,013 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,013 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-11-23 13:58:21,013 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,013 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,032 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][319], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 40#L79true, 17#L58true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 176#L97true, 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,032 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,032 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,032 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,032 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,064 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,064 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,064 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,064 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:21,064 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 1709#true, Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,067 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,067 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,067 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,067 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,069 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,069 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,070 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,070 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,070 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,070 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,076 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,076 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,076 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,076 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,077 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,077 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,086 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,087 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2021-11-23 13:58:21,087 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2021-11-23 13:58:21,087 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2021-11-23 13:58:21,087 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2021-11-23 13:58:21,090 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][290], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 117#L100true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 115#L51-1true, 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,090 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,090 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,090 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,090 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,091 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,098 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,098 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,099 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,099 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,099 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,099 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 99#L61true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,100 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,100 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,100 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,100 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,100 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,101 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,101 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,101 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,101 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,101 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,102 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 99#L61true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,102 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,102 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,102 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,102 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,116 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,117 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,117 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,117 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,117 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,183 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 115#L51-1true, 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 176#L97true, Black: 311#(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|)), 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2021-11-23 13:58:21,184 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,184 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:21,184 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,184 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,184 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:21,185 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][315], [4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 24#L115true, Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 99#L61true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,186 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,186 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,186 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,186 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:21,192 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 155#L52true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,192 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,192 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 155#L52true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,193 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,193 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,253 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][290], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 115#L51-1true, 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 311#(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|)), 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2021-11-23 13:58:21,253 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,253 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,253 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,253 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,254 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,254 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,255 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,255 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,255 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,255 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,275 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][289], [111#L92-1true, Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 115#L51-1true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,275 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,275 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,276 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,276 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:21,384 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][315], [24#L115true, 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 155#L52true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 358#true, 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,384 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,384 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,384 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:21,384 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:21,474 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,474 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,474 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,475 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,475 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,475 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:21,475 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:21,601 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][253], [4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 240#L118true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 1709#true, Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,601 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,601 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,601 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,601 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,602 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][245], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,602 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,602 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,602 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,602 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:21,634 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][315], [24#L115true, 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,634 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2021-11-23 13:58:21,634 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,634 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:21,635 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-11-23 13:58:21,849 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:21,849 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2021-11-23 13:58:21,849 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-11-23 13:58:21,849 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-11-23 13:58:21,849 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-11-23 13:58:21,850 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][193], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:21,850 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2021-11-23 13:58:21,850 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2021-11-23 13:58:21,850 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:21,850 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:22,005 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][382], [111#L92-1true, 24#L115true, Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:22,006 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2021-11-23 13:58:22,006 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-11-23 13:58:22,006 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-11-23 13:58:22,006 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-11-23 13:58:22,174 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][315], [24#L115true, 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 228#L146-2true, 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:22,174 INFO L384 tUnfolder$Statistics]: this new event has 209 ancestors and is cut-off event [2021-11-23 13:58:22,174 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2021-11-23 13:58:22,174 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2021-11-23 13:58:22,175 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2021-11-23 13:58:22,256 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][382], [111#L92-1true, 24#L115true, Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 228#L146-2true, 358#true, 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:22,256 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2021-11-23 13:58:22,257 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-11-23 13:58:22,257 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-11-23 13:58:22,257 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2021-11-23 13:58:22,304 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1017] L111-->L115: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1|))) (and (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (not (= 0 |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (= |v_thread4Thread1of1ForFork0_plus_~b#1_1| |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= v_~total~0_64 |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (= |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_#in~a#1_1|) (not (= (ite (and (< v_~q2_front~0_59 v_~n2~0_22) (< v_~q2_front~0_59 v_~q2_back~0_69) (<= 0 v_~q2_front~0_59)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| .cse0) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_1| |v_thread4Thread1of1ForFork0_plus_~b#1_1| 2147483648)) (<= 0 |v_thread4Thread1of1ForFork0_plus_~b#1_1|)) 1 0) 0)) (= (select (select |v_#memory_int_86| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* v_~q2_front~0_59 4))) |v_thread4Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_63) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_86|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_69, ~total~0=v_~total~0_64} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_29, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, ~total~0=v_~total~0_63, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_86|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_69} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][382], [24#L115true, Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), Black: 3071#(and (<= ~j~0 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 92#L147-2true, 358#true, 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:22,305 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2021-11-23 13:58:22,305 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2021-11-23 13:58:22,305 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2021-11-23 13:58:22,305 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2021-11-23 13:58:22,347 INFO L129 PetriNetUnfolder]: 7112/16025 cut-off events. [2021-11-23 13:58:22,347 INFO L130 PetriNetUnfolder]: For 133971/135887 co-relation queries the response was YES. [2021-11-23 13:58:22,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70564 conditions, 16025 events. 7112/16025 cut-off events. For 133971/135887 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 159588 event pairs, 1001 based on Foata normal form. 1103/15913 useless extension candidates. Maximal degree in co-relation 70532. Up to 3995 conditions per place. [2021-11-23 13:58:22,697 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 151 selfloop transitions, 40 changer transitions 0/422 dead transitions. [2021-11-23 13:58:22,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 422 transitions, 3120 flow [2021-11-23 13:58:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:58:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-23 13:58:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2021-11-23 13:58:22,702 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8968553459119497 [2021-11-23 13:58:22,702 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1426 transitions. [2021-11-23 13:58:22,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1426 transitions. [2021-11-23 13:58:22,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:22,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1426 transitions. [2021-11-23 13:58:22,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.66666666666666) internal successors, (1426), 6 states have internal predecessors, (1426), 0 states have call successors, (0), 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-11-23 13:58:22,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-11-23 13:58:22,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-11-23 13:58:22,714 INFO L186 Difference]: Start difference. First operand has 284 places, 319 transitions, 1647 flow. Second operand 6 states and 1426 transitions. [2021-11-23 13:58:22,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 422 transitions, 3120 flow [2021-11-23 13:58:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 422 transitions, 3075 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-11-23 13:58:23,002 INFO L242 Difference]: Finished difference. Result has 291 places, 339 transitions, 1993 flow [2021-11-23 13:58:23,003 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1993, PETRI_PLACES=291, PETRI_TRANSITIONS=339} [2021-11-23 13:58:23,007 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 52 predicate places. [2021-11-23 13:58:23,008 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 339 transitions, 1993 flow [2021-11-23 13:58:23,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 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-11-23 13:58:23,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:23,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:23,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 13:58:23,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 13:58:23,209 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-23 13:58:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1841621033, now seen corresponding path program 2 times [2021-11-23 13:58:23,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706171086] [2021-11-23 13:58:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:23,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:58:23,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:23,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706171086] [2021-11-23 13:58:23,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706171086] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:58:23,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:58:23,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 13:58:23,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614437532] [2021-11-23 13:58:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:58:23,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 13:58:23,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:58:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 13:58:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-23 13:58:23,614 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-11-23 13:58:23,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 339 transitions, 1993 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-23 13:58:23,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:58:23,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-11-23 13:58:23,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:58:26,375 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 3768#(<= ~q1_front~0 ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 358#true, 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:26,375 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2021-11-23 13:58:26,375 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-11-23 13:58:26,375 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-11-23 13:58:26,375 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:26,392 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 3768#(<= ~q1_front~0 ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:26,392 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-11-23 13:58:26,392 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:26,392 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-11-23 13:58:26,392 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:26,899 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 117#L100true, Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, 25#L111true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:26,899 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-11-23 13:58:26,899 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:26,900 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:26,900 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-11-23 13:58:27,309 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 40#L79true, 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:27,310 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-11-23 13:58:27,310 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:27,310 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:27,310 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-11-23 13:58:27,880 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3768#(<= ~q1_front~0 ~q1_back~0), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 40#L79true, 115#L51-1true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), 176#L97true, Black: 311#(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|))]) [2021-11-23 13:58:27,880 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-11-23 13:58:27,880 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-11-23 13:58:27,880 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:27,881 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-11-23 13:58:28,207 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 3768#(<= ~q1_front~0 ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 117#L100true, Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 294#(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|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 4445#true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:28,207 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-11-23 13:58:28,207 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:28,207 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-11-23 13:58:28,207 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-11-23 13:58:28,644 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int_88| v_~f~0.base_40) (+ v_~f~0.offset_40 (* v_~j~0_49 4))))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (+ v_~j~0_49 1) v_~j~0_48) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q2_back~0_76 2147483647) 1 0)) (not (= (ite (= (- .cse0) (select (select |v_#memory_int_88| v_~q2~0.base_31) (+ v_~q2~0.offset_31 (* v_~q2_back~0_76 4)))) 1 0) 0)) (= v_~q2_back~0_75 (+ v_~q2_back~0_76 1)) (not (= (ite (and (<= 0 v_~q2_back~0_76) (< v_~q2_back~0_76 v_~n2~0_24)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|))) InVars {~j~0=v_~j~0_49, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_88|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_76, ~f~0.offset=v_~f~0.offset_40} OutVars{~j~0=v_~j~0_48, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_40, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, ~f~0.offset=v_~f~0.offset_40, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1][209], [Black: 1709#true, Black: 3075#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)) (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256))), Black: 2493#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| |ULTIMATE.start_create_fresh_int_array_~i~1#1|) (< ~i~0 ~N~0)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0)), 3682#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0)))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~i~0 ~N~0)), 2478#(< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)), Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 4439#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 4314#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 3768#(<= ~q1_front~0 ~q1_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 358#true, 4437#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1705#(and (= ~j~0 0) (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 294#(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: 1695#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 38#L144-4true, 115#L51-1true, 40#L79true, Black: 3754#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3758#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), 25#L111true, 4445#true, Black: 3084#(<= ~q2_front~0 ~q2_back~0), Black: 3756#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (or (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 3615#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(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|))]) [2021-11-23 13:58:28,644 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-11-23 13:58:28,644 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:28,644 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-11-23 13:58:28,644 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-11-23 13:58:29,707 INFO L129 PetriNetUnfolder]: 13937/25813 cut-off events. [2021-11-23 13:58:29,707 INFO L130 PetriNetUnfolder]: For 188359/189022 co-relation queries the response was YES. [2021-11-23 13:58:29,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114574 conditions, 25813 events. 13937/25813 cut-off events. For 188359/189022 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 230687 event pairs, 3870 based on Foata normal form. 692/25396 useless extension candidates. Maximal degree in co-relation 114539. Up to 14842 conditions per place. [2021-11-23 13:58:30,045 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 234 selfloop transitions, 23 changer transitions 0/424 dead transitions. [2021-11-23 13:58:30,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 424 transitions, 3259 flow [2021-11-23 13:58:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:58:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:58:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2021-11-23 13:58:30,049 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2021-11-23 13:58:30,049 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2021-11-23 13:58:30,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2021-11-23 13:58:30,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:58:30,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2021-11-23 13:58:30,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 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-11-23 13:58:30,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:30,058 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 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-11-23 13:58:30,058 INFO L186 Difference]: Start difference. First operand has 291 places, 339 transitions, 1993 flow. Second operand 9 states and 1751 transitions. [2021-11-23 13:58:30,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 424 transitions, 3259 flow [2021-11-23 13:58:30,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 424 transitions, 3204 flow, removed 27 selfloop flow, removed 1 redundant places. [2021-11-23 13:58:30,856 INFO L242 Difference]: Finished difference. Result has 300 places, 336 transitions, 1946 flow [2021-11-23 13:58:30,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1946, PETRI_PLACES=300, PETRI_TRANSITIONS=336} [2021-11-23 13:58:30,858 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 61 predicate places. [2021-11-23 13:58:30,858 INFO L470 AbstractCegarLoop]: Abstraction has has 300 places, 336 transitions, 1946 flow [2021-11-23 13:58:30,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-23 13:58:30,859 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:58:30,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 13:58:30,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 13:58:30,860 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-23 13:58:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:58:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1233136602, now seen corresponding path program 1 times [2021-11-23 13:58:30,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:58:30,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170112411] [2021-11-23 13:58:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:30,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:58:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:58:39,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:58:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170112411] [2021-11-23 13:58:39,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170112411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:58:39,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912238485] [2021-11-23 13:58:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:58:39,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:58:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:58:39,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:58:39,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f4706c-aef9-4cb8-baa1-41b7ea3cf692/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 13:58:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:58:39,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 107 conjunts are in the unsatisfiable core [2021-11-23 13:58:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:58:43,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 13:58:44,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 13:58:46,506 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 13:58:46,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-23 13:58:47,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-23 13:58:48,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 13:58:49,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 13:58:49,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 13:58:49,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-23 13:58:52,548 INFO L354 Elim1Store]: treesize reduction 61, result has 38.4 percent of original size [2021-11-23 13:58:52,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 72 [2021-11-23 13:58:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:58:52,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:06:02,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 14:06:02,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2558047956 treesize of output 2540484564