./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 08:57:57,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 08:57:57,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 08:57:57,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 08:57:57,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 08:57:57,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 08:57:57,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 08:57:57,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 08:57:57,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 08:57:57,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 08:57:57,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 08:57:57,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 08:57:57,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 08:57:57,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 08:57:57,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 08:57:57,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 08:57:57,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 08:57:57,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 08:57:57,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 08:57:57,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 08:57:57,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 08:57:57,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 08:57:57,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 08:57:57,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 08:57:57,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 08:57:57,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 08:57:57,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 08:57:57,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 08:57:57,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 08:57:57,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 08:57:57,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 08:57:57,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 08:57:57,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 08:57:57,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 08:57:57,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 08:57:57,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 08:57:57,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 08:57:57,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 08:57:57,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 08:57:57,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 08:57:57,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 08:57:57,657 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 08:57:57,701 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 08:57:57,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 08:57:57,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 08:57:57,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 08:57:57,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 08:57:57,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 08:57:57,708 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 08:57:57,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 08:57:57,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 08:57:57,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 08:57:57,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 08:57:57,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 08:57:57,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 08:57:57,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 08:57:57,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 08:57:57,711 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 08:57:57,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 08:57:57,711 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 08:57:57,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 08:57:57,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 08:57:57,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 08:57:57,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 08:57:57,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:57:57,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 08:57:57,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 08:57:57,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 08:57:57,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 08:57:57,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 08:57:57,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 08:57:57,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 08:57:57,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 08:57:57,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 08:57:57,733 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_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/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_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 [2021-11-09 08:57:58,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 08:57:58,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 08:57:58,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 08:57:58,057 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 08:57:58,058 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 08:57:58,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2021-11-09 08:57:58,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/data/515e02e9c/059a1cfcee5e4cbc832498746f78dfbd/FLAG359a7bafa [2021-11-09 08:57:58,593 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 08:57:58,595 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2021-11-09 08:57:58,609 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/data/515e02e9c/059a1cfcee5e4cbc832498746f78dfbd/FLAG359a7bafa [2021-11-09 08:57:58,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/data/515e02e9c/059a1cfcee5e4cbc832498746f78dfbd [2021-11-09 08:57:58,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 08:57:58,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 08:57:58,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 08:57:58,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 08:57:58,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 08:57:58,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:57:58" (1/1) ... [2021-11-09 08:57:58,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f29131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:58, skipping insertion in model container [2021-11-09 08:57:58,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:57:58" (1/1) ... [2021-11-09 08:57:58,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 08:57:59,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 08:57:59,253 WARN L228 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_9b139a00-fc7f-4b1a-8dd8-784e7277266f/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2021-11-09 08:57:59,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:57:59,271 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 08:57:59,301 WARN L228 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_9b139a00-fc7f-4b1a-8dd8-784e7277266f/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2021-11-09 08:57:59,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:57:59,321 INFO L208 MainTranslator]: Completed translation [2021-11-09 08:57:59,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59 WrapperNode [2021-11-09 08:57:59,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 08:57:59,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 08:57:59,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 08:57:59,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 08:57:59,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 08:57:59,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 08:57:59,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 08:57:59,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 08:57:59,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 08:57:59,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 08:57:59,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 08:57:59,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 08:57:59,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (1/1) ... [2021-11-09 08:57:59,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 08:57:59,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:57:59,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 08:57:59,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 08:57:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 08:57:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 08:57:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 08:57:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-09 08:57:59,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-09 08:57:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-09 08:57:59,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-09 08:57:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-09 08:57:59,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-09 08:57:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-09 08:57:59,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-09 08:57:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 08:57:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-09 08:57:59,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-09 08:57:59,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 08:57:59,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 08:57:59,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 08:57:59,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 08:57:59,515 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-09 08:58:00,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 08:58:00,763 INFO L299 CfgBuilder]: Removed 48 assume(true) statements. [2021-11-09 08:58:00,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:58:00 BoogieIcfgContainer [2021-11-09 08:58:00,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 08:58:00,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 08:58:00,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 08:58:00,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 08:58:00,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:57:58" (1/3) ... [2021-11-09 08:58:00,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5879bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:58:00, skipping insertion in model container [2021-11-09 08:58:00,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:57:59" (2/3) ... [2021-11-09 08:58:00,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5879bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:58:00, skipping insertion in model container [2021-11-09 08:58:00,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:58:00" (3/3) ... [2021-11-09 08:58:00,777 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2021-11-09 08:58:00,782 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-09 08:58:00,783 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 08:58:00,783 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 08:58:00,783 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-09 08:58:00,861 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,861 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,861 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,864 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,866 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,868 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,868 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,869 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,870 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,870 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,870 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,874 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,876 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,876 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,876 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,876 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,877 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,877 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,878 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,878 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,881 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,882 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,882 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,883 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,885 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,887 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,888 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,888 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,888 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,890 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,890 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,890 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,891 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,891 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,897 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,899 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,899 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,900 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,901 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,902 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,905 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,905 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,905 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,905 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,905 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,906 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,911 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,912 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_~cond~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,915 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~a not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_plus_~b not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_plus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,916 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,919 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,921 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,922 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,922 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,922 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 08:58:00,939 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-11-09 08:58:00,988 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 08:58:00,995 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-09 08:58:00,995 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-09 08:58:01,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 223 transitions, 478 flow [2021-11-09 08:58:01,097 INFO L129 PetriNetUnfolder]: 19/219 cut-off events. [2021-11-09 08:58:01,098 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-09 08:58:01,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 219 events. 19/219 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 116 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2021-11-09 08:58:01,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 223 transitions, 478 flow [2021-11-09 08:58:01,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 207 transitions, 438 flow [2021-11-09 08:58:01,162 INFO L129 PetriNetUnfolder]: 19/206 cut-off events. [2021-11-09 08:58:01,167 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-09 08:58:01,167 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:01,168 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] [2021-11-09 08:58:01,168 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-09 08:58:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 847553476, now seen corresponding path program 1 times [2021-11-09 08:58:01,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:01,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96436063] [2021-11-09 08:58:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:01,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:01,964 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-09 08:58:01,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:01,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96436063] [2021-11-09 08:58:01,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96436063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:58:01,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:58:01,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 08:58:01,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558434419] [2021-11-09 08:58:01,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 08:58:01,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 08:58:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-09 08:58:01,996 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 223 [2021-11-09 08:58:02,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 207 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 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-09 08:58:02,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:02,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 223 [2021-11-09 08:58:02,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:02,325 INFO L129 PetriNetUnfolder]: 27/273 cut-off events. [2021-11-09 08:58:02,325 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-11-09 08:58:02,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 273 events. 27/273 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 447 event pairs, 4 based on Foata normal form. 44/293 useless extension candidates. Maximal degree in co-relation 316. Up to 29 conditions per place. [2021-11-09 08:58:02,334 INFO L132 encePairwiseOnDemand]: 196/223 looper letters, 42 selfloop transitions, 8 changer transitions 7/205 dead transitions. [2021-11-09 08:58:02,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 205 transitions, 551 flow [2021-11-09 08:58:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 08:58:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-09 08:58:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1713 transitions. [2021-11-09 08:58:02,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7681614349775785 [2021-11-09 08:58:02,363 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1713 transitions. [2021-11-09 08:58:02,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1713 transitions. [2021-11-09 08:58:02,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:02,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1713 transitions. [2021-11-09 08:58:02,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 171.3) internal successors, (1713), 10 states have internal predecessors, (1713), 0 states have call successors, (0), 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-09 08:58:02,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 223.0) internal successors, (2453), 11 states have internal predecessors, (2453), 0 states have call successors, (0), 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-09 08:58:02,400 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 223.0) internal successors, (2453), 11 states have internal predecessors, (2453), 0 states have call successors, (0), 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-09 08:58:02,402 INFO L186 Difference]: Start difference. First operand has 201 places, 207 transitions, 438 flow. Second operand 10 states and 1713 transitions. [2021-11-09 08:58:02,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 205 transitions, 551 flow [2021-11-09 08:58:02,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 205 transitions, 533 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-11-09 08:58:02,417 INFO L242 Difference]: Finished difference. Result has 205 places, 191 transitions, 425 flow [2021-11-09 08:58:02,419 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=425, PETRI_PLACES=205, PETRI_TRANSITIONS=191} [2021-11-09 08:58:02,425 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 4 predicate places. [2021-11-09 08:58:02,426 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 191 transitions, 425 flow [2021-11-09 08:58:02,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 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-09 08:58:02,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:02,428 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] [2021-11-09 08:58:02,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 08:58:02,428 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-09 08:58:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1022077561, now seen corresponding path program 1 times [2021-11-09 08:58:02,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:02,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971680864] [2021-11-09 08:58:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:02,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:02,726 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-09 08:58:02,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:02,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971680864] [2021-11-09 08:58:02,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971680864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:58:02,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:58:02,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 08:58:02,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336054771] [2021-11-09 08:58:02,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 08:58:02,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 08:58:02,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-09 08:58:02,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 223 [2021-11-09 08:58:02,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 191 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 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-09 08:58:02,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:02,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 223 [2021-11-09 08:58:02,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:02,983 INFO L129 PetriNetUnfolder]: 51/380 cut-off events. [2021-11-09 08:58:02,983 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2021-11-09 08:58:02,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 380 events. 51/380 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1047 event pairs, 4 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 370. Up to 41 conditions per place. [2021-11-09 08:58:02,990 INFO L132 encePairwiseOnDemand]: 215/223 looper letters, 55 selfloop transitions, 13 changer transitions 0/211 dead transitions. [2021-11-09 08:58:02,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 211 transitions, 627 flow [2021-11-09 08:58:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 08:58:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-09 08:58:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1329 transitions. [2021-11-09 08:58:02,995 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7449551569506726 [2021-11-09 08:58:02,995 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1329 transitions. [2021-11-09 08:58:02,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1329 transitions. [2021-11-09 08:58:02,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:02,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1329 transitions. [2021-11-09 08:58:03,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.125) internal successors, (1329), 8 states have internal predecessors, (1329), 0 states have call successors, (0), 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-09 08:58:03,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 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-09 08:58:03,008 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 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-09 08:58:03,008 INFO L186 Difference]: Start difference. First operand has 205 places, 191 transitions, 425 flow. Second operand 8 states and 1329 transitions. [2021-11-09 08:58:03,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 211 transitions, 627 flow [2021-11-09 08:58:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 211 transitions, 617 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-11-09 08:58:03,017 INFO L242 Difference]: Finished difference. Result has 203 places, 198 transitions, 505 flow [2021-11-09 08:58:03,018 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=505, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2021-11-09 08:58:03,018 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 2 predicate places. [2021-11-09 08:58:03,018 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 505 flow [2021-11-09 08:58:03,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 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-09 08:58:03,020 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:03,020 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] [2021-11-09 08:58:03,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 08:58:03,020 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-09 08:58:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1276926846, now seen corresponding path program 1 times [2021-11-09 08:58:03,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:03,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760502579] [2021-11-09 08:58:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:03,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:03,153 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-09 08:58:03,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:03,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760502579] [2021-11-09 08:58:03,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760502579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:58:03,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:58:03,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 08:58:03,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728506531] [2021-11-09 08:58:03,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 08:58:03,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 08:58:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-09 08:58:03,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 223 [2021-11-09 08:58:03,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 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-09 08:58:03,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:03,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 223 [2021-11-09 08:58:03,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:03,334 INFO L129 PetriNetUnfolder]: 24/392 cut-off events. [2021-11-09 08:58:03,334 INFO L130 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2021-11-09 08:58:03,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 392 events. 24/392 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 958 event pairs, 1 based on Foata normal form. 3/376 useless extension candidates. Maximal degree in co-relation 420. Up to 34 conditions per place. [2021-11-09 08:58:03,340 INFO L132 encePairwiseOnDemand]: 212/223 looper letters, 30 selfloop transitions, 8 changer transitions 13/215 dead transitions. [2021-11-09 08:58:03,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 215 transitions, 641 flow [2021-11-09 08:58:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 08:58:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-09 08:58:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1676 transitions. [2021-11-09 08:58:03,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8350772296960638 [2021-11-09 08:58:03,346 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1676 transitions. [2021-11-09 08:58:03,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1676 transitions. [2021-11-09 08:58:03,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:03,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1676 transitions. [2021-11-09 08:58:03,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 08:58:03,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 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-09 08:58:03,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 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-09 08:58:03,362 INFO L186 Difference]: Start difference. First operand has 203 places, 198 transitions, 505 flow. Second operand 9 states and 1676 transitions. [2021-11-09 08:58:03,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 215 transitions, 641 flow [2021-11-09 08:58:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 215 transitions, 630 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-11-09 08:58:03,374 INFO L242 Difference]: Finished difference. Result has 210 places, 199 transitions, 526 flow [2021-11-09 08:58:03,375 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=210, PETRI_TRANSITIONS=199} [2021-11-09 08:58:03,375 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 9 predicate places. [2021-11-09 08:58:03,375 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 199 transitions, 526 flow [2021-11-09 08:58:03,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 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-09 08:58:03,376 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:03,376 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] [2021-11-09 08:58:03,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 08:58:03,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-09 08:58:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1286887705, now seen corresponding path program 1 times [2021-11-09 08:58:03,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:03,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648765316] [2021-11-09 08:58:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:03,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:04,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:04,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648765316] [2021-11-09 08:58:04,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648765316] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:04,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107044129] [2021-11-09 08:58:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:04,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:04,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:58:04,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:58:04,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 08:58:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:04,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-09 08:58:04,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:58:07,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-11-09 08:58:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:07,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107044129] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:07,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:58:07,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2021-11-09 08:58:07,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274888373] [2021-11-09 08:58:07,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-09 08:58:07,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-09 08:58:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2021-11-09 08:58:07,356 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 223 [2021-11-09 08:58:07,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 199 transitions, 526 flow. Second operand has 42 states, 42 states have (on average 100.30952380952381) internal successors, (4213), 42 states have internal predecessors, (4213), 0 states have call successors, (0), 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-09 08:58:07,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:07,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 223 [2021-11-09 08:58:07,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:13,880 INFO L129 PetriNetUnfolder]: 9407/16493 cut-off events. [2021-11-09 08:58:13,880 INFO L130 PetriNetUnfolder]: For 16499/16499 co-relation queries the response was YES. [2021-11-09 08:58:13,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37982 conditions, 16493 events. 9407/16493 cut-off events. For 16499/16499 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 129439 event pairs, 1734 based on Foata normal form. 236/15531 useless extension candidates. Maximal degree in co-relation 31744. Up to 5604 conditions per place. [2021-11-09 08:58:14,097 INFO L132 encePairwiseOnDemand]: 188/223 looper letters, 301 selfloop transitions, 74 changer transitions 8/464 dead transitions. [2021-11-09 08:58:14,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 464 transitions, 2118 flow [2021-11-09 08:58:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-09 08:58:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-11-09 08:58:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4300 transitions. [2021-11-09 08:58:14,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4703051514820081 [2021-11-09 08:58:14,113 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4300 transitions. [2021-11-09 08:58:14,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4300 transitions. [2021-11-09 08:58:14,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:14,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4300 transitions. [2021-11-09 08:58:14,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 104.8780487804878) internal successors, (4300), 41 states have internal predecessors, (4300), 0 states have call successors, (0), 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-09 08:58:14,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 223.0) internal successors, (9366), 42 states have internal predecessors, (9366), 0 states have call successors, (0), 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-09 08:58:14,152 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 223.0) internal successors, (9366), 42 states have internal predecessors, (9366), 0 states have call successors, (0), 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-09 08:58:14,152 INFO L186 Difference]: Start difference. First operand has 210 places, 199 transitions, 526 flow. Second operand 41 states and 4300 transitions. [2021-11-09 08:58:14,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 464 transitions, 2118 flow [2021-11-09 08:58:14,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 464 transitions, 2080 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-11-09 08:58:14,203 INFO L242 Difference]: Finished difference. Result has 270 places, 262 transitions, 1112 flow [2021-11-09 08:58:14,203 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1112, PETRI_PLACES=270, PETRI_TRANSITIONS=262} [2021-11-09 08:58:14,204 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 69 predicate places. [2021-11-09 08:58:14,204 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 262 transitions, 1112 flow [2021-11-09 08:58:14,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 100.30952380952381) internal successors, (4213), 42 states have internal predecessors, (4213), 0 states have call successors, (0), 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-09 08:58:14,206 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:14,207 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] [2021-11-09 08:58:14,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-09 08:58:14,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:14,424 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-09 08:58:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1023440795, now seen corresponding path program 2 times [2021-11-09 08:58:14,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:14,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215394721] [2021-11-09 08:58:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:14,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:15,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:15,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215394721] [2021-11-09 08:58:15,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215394721] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:15,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420659385] [2021-11-09 08:58:15,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 08:58:15,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:58:15,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:58:15,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-09 08:58:16,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 08:58:16,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 08:58:16,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-09 08:58:16,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:58:17,842 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-09 08:58:19,436 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-09 08:58:20,029 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-09 08:58:20,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-09 08:58:20,352 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-09 08:58:20,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-09 08:58:20,715 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-09 08:58:20,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-09 08:58:20,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-09 08:58:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:21,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420659385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:21,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:58:21,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 49 [2021-11-09 08:58:21,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114282672] [2021-11-09 08:58:21,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-09 08:58:21,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:21,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-09 08:58:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2152, Unknown=0, NotChecked=0, Total=2352 [2021-11-09 08:58:21,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223 [2021-11-09 08:58:21,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 262 transitions, 1112 flow. Second operand has 49 states, 49 states have (on average 101.3265306122449) internal successors, (4965), 49 states have internal predecessors, (4965), 0 states have call successors, (0), 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-09 08:58:21,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:21,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223 [2021-11-09 08:58:21,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:27,648 INFO L129 PetriNetUnfolder]: 1801/4491 cut-off events. [2021-11-09 08:58:27,648 INFO L130 PetriNetUnfolder]: For 14178/14303 co-relation queries the response was YES. [2021-11-09 08:58:27,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12652 conditions, 4491 events. 1801/4491 cut-off events. For 14178/14303 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 35195 event pairs, 168 based on Foata normal form. 68/4178 useless extension candidates. Maximal degree in co-relation 12598. Up to 1374 conditions per place. [2021-11-09 08:58:27,735 INFO L132 encePairwiseOnDemand]: 192/223 looper letters, 212 selfloop transitions, 67 changer transitions 14/384 dead transitions. [2021-11-09 08:58:27,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 384 transitions, 2240 flow [2021-11-09 08:58:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-09 08:58:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-11-09 08:58:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4358 transitions. [2021-11-09 08:58:27,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.465300021353833 [2021-11-09 08:58:27,754 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4358 transitions. [2021-11-09 08:58:27,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4358 transitions. [2021-11-09 08:58:27,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:27,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4358 transitions. [2021-11-09 08:58:27,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 103.76190476190476) internal successors, (4358), 42 states have internal predecessors, (4358), 0 states have call successors, (0), 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-09 08:58:27,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 223.0) internal successors, (9589), 43 states have internal predecessors, (9589), 0 states have call successors, (0), 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-09 08:58:27,796 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 223.0) internal successors, (9589), 43 states have internal predecessors, (9589), 0 states have call successors, (0), 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-09 08:58:27,797 INFO L186 Difference]: Start difference. First operand has 270 places, 262 transitions, 1112 flow. Second operand 42 states and 4358 transitions. [2021-11-09 08:58:27,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 384 transitions, 2240 flow [2021-11-09 08:58:27,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 384 transitions, 2118 flow, removed 50 selfloop flow, removed 15 redundant places. [2021-11-09 08:58:27,842 INFO L242 Difference]: Finished difference. Result has 302 places, 267 transitions, 1286 flow [2021-11-09 08:58:27,843 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=1286, PETRI_PLACES=302, PETRI_TRANSITIONS=267} [2021-11-09 08:58:27,843 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 101 predicate places. [2021-11-09 08:58:27,843 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 267 transitions, 1286 flow [2021-11-09 08:58:27,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 101.3265306122449) internal successors, (4965), 49 states have internal predecessors, (4965), 0 states have call successors, (0), 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-09 08:58:27,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:27,846 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] [2021-11-09 08:58:27,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-09 08:58:28,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:28,070 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-09 08:58:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1935904420, now seen corresponding path program 1 times [2021-11-09 08:58:28,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:28,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638467003] [2021-11-09 08:58:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:28,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-09 08:58:28,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:28,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638467003] [2021-11-09 08:58:28,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638467003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:58:28,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:58:28,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 08:58:28,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021102515] [2021-11-09 08:58:28,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 08:58:28,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 08:58:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-09 08:58:28,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 223 [2021-11-09 08:58:28,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 267 transitions, 1286 flow. Second operand has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 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-09 08:58:28,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:28,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 223 [2021-11-09 08:58:28,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:28,649 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([795] L106-->L110: Formula: (let ((.cse0 (+ v_thread4Thread1of1ForFork2_plus_~a_1 v_thread4Thread1of1ForFork2_plus_~b_1))) (and (= |v_thread4Thread1of1ForFork2_plus_#res_1| v_~total~0_47) (= (+ v_~q2_front~0_49 1) v_~q2_front~0_48) (not (= v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res_1| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res_1| .cse0) (<= |v_thread4Thread1of1ForFork2_plus_#res_1| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~b_1| (select (select |v_#memory_int_45| v_~q2~0.base_17) (+ v_~q2~0.offset_17 (* v_~q2_front~0_49 4)))) (= v_thread4Thread1of1ForFork2_plus_~a_1 |v_thread4Thread1of1ForFork2_plus_#in~a_1|) (= |v_thread4Thread1of1ForFork2_plus_#in~a_1| v_~total~0_48) (= v_thread4Thread1of1ForFork2_plus_~b_1 |v_thread4Thread1of1ForFork2_plus_#in~b_1|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1| v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1) (not (= (ite (and (<= 0 v_~q2_front~0_49) (< v_~q2_front~0_49 v_~n2~0_14) (< v_~q2_front~0_49 v_~q2_back~0_43)) 1 0) 0)) (= (ite (or (<= v_thread4Thread1of1ForFork2_plus_~b_1 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1|) (not (= (ite (or (<= 0 v_thread4Thread1of1ForFork2_plus_~b_1) (<= 0 (+ v_thread4Thread1of1ForFork2_plus_~a_1 v_thread4Thread1of1ForFork2_plus_~b_1 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_14, ~q2~0.offset=v_~q2~0.offset_17, #memory_int=|v_#memory_int_45|, ~q2_front~0=v_~q2_front~0_49, ~q2~0.base=v_~q2~0.base_17, ~q2_back~0=v_~q2_back~0_43, ~total~0=v_~total~0_48} OutVars{~n2~0=v_~n2~0_14, thread4Thread1of1ForFork2_#t~ret15=|v_thread4Thread1of1ForFork2_#t~ret15_1|, ~q2~0.offset=v_~q2~0.offset_17, ~q2_front~0=v_~q2_front~0_48, ~total~0=v_~total~0_47, thread4Thread1of1ForFork2_plus_#res=|v_thread4Thread1of1ForFork2_plus_#res_1|, thread4Thread1of1ForFork2_#t~post16=|v_thread4Thread1of1ForFork2_#t~post16_1|, thread4Thread1of1ForFork2_plus_~a=v_thread4Thread1of1ForFork2_plus_~a_1, thread4Thread1of1ForFork2_plus_~b=v_thread4Thread1of1ForFork2_plus_~b_1, thread4Thread1of1ForFork2_#t~mem14=|v_thread4Thread1of1ForFork2_#t~mem14_1|, #memory_int=|v_#memory_int_45|, ~q2~0.base=v_~q2~0.base_17, thread4Thread1of1ForFork2_plus_#in~a=|v_thread4Thread1of1ForFork2_plus_#in~a_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond=v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1, ~q2_back~0=v_~q2_back~0_43, thread4Thread1of1ForFork2_plus_#in~b=|v_thread4Thread1of1ForFork2_plus_#in~b_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#res, thread4Thread1of1ForFork2_#t~post16, thread4Thread1of1ForFork2_plus_~a, thread4Thread1of1ForFork2_plus_~b, thread4Thread1of1ForFork2_#t~ret15, thread4Thread1of1ForFork2_#t~mem14, ~q2_front~0, thread4Thread1of1ForFork2_plus_#in~a, thread4Thread1of1ForFork2_assume_abort_if_not_~cond, ~total~0, thread4Thread1of1ForFork2_plus_#in~b, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond][245], [Black: 251#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 243#(<= ~q1_front~0 ~q1_back~0), 1595#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 249#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 114#L110true, 18#L92true, Black: 878#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 276#true, Black: 876#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0) (<= 1 ~C~0)), Black: 862#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (= |ULTIMATE.start_main_#t~ret26.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 890#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 852#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 874#(and (= ~total~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 1 ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0))) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0))), Black: 268#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 866#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 880#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~C~0)), Black: 860#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (= |ULTIMATE.start_main_#t~ret26.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 884#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= 1 ~C~0)), Black: 892#(and (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 295#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 848#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 872#(and (= ~total~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 1 ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0))), Black: 856#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 854#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 886#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 932#true, Black: 870#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1)), Black: 858#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 1553#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1563#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1559#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1569#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 952#(and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (and (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0) (not (= |ULTIMATE.start_main_~#t4~0.base| ~q1~0.base)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|))), Black: 225#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1561#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 234#(and (= ~i~0 0) (<= 1 ~N~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 954#(<= 1 ~total~0), Black: 226#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 1567#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1557#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1571#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 253#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 1565#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 112#L56true, Black: 1573#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1555#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), 200#L74true, 163#L143-4true]) [2021-11-09 08:58:28,650 INFO L384 tUnfolder$Statistics]: this new event has 158 ancestors and is cut-off event [2021-11-09 08:58:28,650 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2021-11-09 08:58:28,650 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2021-11-09 08:58:28,650 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2021-11-09 08:58:28,652 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([795] L106-->L110: Formula: (let ((.cse0 (+ v_thread4Thread1of1ForFork2_plus_~a_1 v_thread4Thread1of1ForFork2_plus_~b_1))) (and (= |v_thread4Thread1of1ForFork2_plus_#res_1| v_~total~0_47) (= (+ v_~q2_front~0_49 1) v_~q2_front~0_48) (not (= v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res_1| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res_1| .cse0) (<= |v_thread4Thread1of1ForFork2_plus_#res_1| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~b_1| (select (select |v_#memory_int_45| v_~q2~0.base_17) (+ v_~q2~0.offset_17 (* v_~q2_front~0_49 4)))) (= v_thread4Thread1of1ForFork2_plus_~a_1 |v_thread4Thread1of1ForFork2_plus_#in~a_1|) (= |v_thread4Thread1of1ForFork2_plus_#in~a_1| v_~total~0_48) (= v_thread4Thread1of1ForFork2_plus_~b_1 |v_thread4Thread1of1ForFork2_plus_#in~b_1|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1| v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1) (not (= (ite (and (<= 0 v_~q2_front~0_49) (< v_~q2_front~0_49 v_~n2~0_14) (< v_~q2_front~0_49 v_~q2_back~0_43)) 1 0) 0)) (= (ite (or (<= v_thread4Thread1of1ForFork2_plus_~b_1 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1|) (not (= (ite (or (<= 0 v_thread4Thread1of1ForFork2_plus_~b_1) (<= 0 (+ v_thread4Thread1of1ForFork2_plus_~a_1 v_thread4Thread1of1ForFork2_plus_~b_1 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_14, ~q2~0.offset=v_~q2~0.offset_17, #memory_int=|v_#memory_int_45|, ~q2_front~0=v_~q2_front~0_49, ~q2~0.base=v_~q2~0.base_17, ~q2_back~0=v_~q2_back~0_43, ~total~0=v_~total~0_48} OutVars{~n2~0=v_~n2~0_14, thread4Thread1of1ForFork2_#t~ret15=|v_thread4Thread1of1ForFork2_#t~ret15_1|, ~q2~0.offset=v_~q2~0.offset_17, ~q2_front~0=v_~q2_front~0_48, ~total~0=v_~total~0_47, thread4Thread1of1ForFork2_plus_#res=|v_thread4Thread1of1ForFork2_plus_#res_1|, thread4Thread1of1ForFork2_#t~post16=|v_thread4Thread1of1ForFork2_#t~post16_1|, thread4Thread1of1ForFork2_plus_~a=v_thread4Thread1of1ForFork2_plus_~a_1, thread4Thread1of1ForFork2_plus_~b=v_thread4Thread1of1ForFork2_plus_~b_1, thread4Thread1of1ForFork2_#t~mem14=|v_thread4Thread1of1ForFork2_#t~mem14_1|, #memory_int=|v_#memory_int_45|, ~q2~0.base=v_~q2~0.base_17, thread4Thread1of1ForFork2_plus_#in~a=|v_thread4Thread1of1ForFork2_plus_#in~a_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond=v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond_1, ~q2_back~0=v_~q2_back~0_43, thread4Thread1of1ForFork2_plus_#in~b=|v_thread4Thread1of1ForFork2_plus_#in~b_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#res, thread4Thread1of1ForFork2_#t~post16, thread4Thread1of1ForFork2_plus_~a, thread4Thread1of1ForFork2_plus_~b, thread4Thread1of1ForFork2_#t~ret15, thread4Thread1of1ForFork2_#t~mem14, ~q2_front~0, thread4Thread1of1ForFork2_plus_#in~a, thread4Thread1of1ForFork2_assume_abort_if_not_~cond, ~total~0, thread4Thread1of1ForFork2_plus_#in~b, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond][245], [Black: 251#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1595#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 249#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 18#L92true, 114#L110true, Black: 878#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 243#(<= ~q1_front~0 ~q1_back~0), 276#true, Black: 876#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0) (<= 1 ~C~0)), Black: 862#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (= |ULTIMATE.start_main_#t~ret26.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 890#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 852#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 874#(and (= ~total~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 1 ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0))) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0))), Black: 268#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 866#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 880#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~C~0)), Black: 860#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (= |ULTIMATE.start_main_#t~ret26.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 884#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= 1 ~C~0)), Black: 892#(and (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 295#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 848#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 226#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 872#(and (= ~total~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 1 ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0))), Black: 856#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 854#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 886#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 932#true, Black: 870#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1)), Black: 858#(and (= ~total~0 0) (<= ~n1~0 1) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (= |ULTIMATE.start_create_fresh_int_array_#res.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 1553#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1563#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1559#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1569#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 952#(and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (and (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0) (not (= |ULTIMATE.start_main_~#t4~0.base| ~q1~0.base)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|))), Black: 1561#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 225#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 234#(and (= ~i~0 0) (<= 1 ~N~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 954#(<= 1 ~total~0), Black: 1567#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1557#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1571#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1565#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 112#L56true, Black: 1573#(and (<= 1 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 1555#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), 200#L74true, 163#L143-4true, Black: 253#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))]) [2021-11-09 08:58:28,654 INFO L384 tUnfolder$Statistics]: this new event has 158 ancestors and is cut-off event [2021-11-09 08:58:28,654 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2021-11-09 08:58:28,654 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2021-11-09 08:58:28,654 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2021-11-09 08:58:28,766 INFO L129 PetriNetUnfolder]: 368/2252 cut-off events. [2021-11-09 08:58:28,767 INFO L130 PetriNetUnfolder]: For 7029/7125 co-relation queries the response was YES. [2021-11-09 08:58:28,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 2252 events. 368/2252 cut-off events. For 7029/7125 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 18663 event pairs, 35 based on Foata normal form. 41/2067 useless extension candidates. Maximal degree in co-relation 5342. Up to 208 conditions per place. [2021-11-09 08:58:28,814 INFO L132 encePairwiseOnDemand]: 214/223 looper letters, 48 selfloop transitions, 8 changer transitions 0/272 dead transitions. [2021-11-09 08:58:28,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 272 transitions, 1408 flow [2021-11-09 08:58:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 08:58:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-09 08:58:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1302 transitions. [2021-11-09 08:58:28,818 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8340807174887892 [2021-11-09 08:58:28,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1302 transitions. [2021-11-09 08:58:28,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1302 transitions. [2021-11-09 08:58:28,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:28,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1302 transitions. [2021-11-09 08:58:28,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 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-09 08:58:28,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 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-09 08:58:28,828 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 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-09 08:58:28,828 INFO L186 Difference]: Start difference. First operand has 302 places, 267 transitions, 1286 flow. Second operand 7 states and 1302 transitions. [2021-11-09 08:58:28,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 272 transitions, 1408 flow [2021-11-09 08:58:28,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 272 transitions, 1303 flow, removed 20 selfloop flow, removed 34 redundant places. [2021-11-09 08:58:28,859 INFO L242 Difference]: Finished difference. Result has 268 places, 269 transitions, 1239 flow [2021-11-09 08:58:28,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1239, PETRI_PLACES=268, PETRI_TRANSITIONS=269} [2021-11-09 08:58:28,861 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 67 predicate places. [2021-11-09 08:58:28,861 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 269 transitions, 1239 flow [2021-11-09 08:58:28,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 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-09 08:58:28,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:28,862 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:58:28,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 08:58:28,862 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-09 08:58:28,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 880363552, now seen corresponding path program 3 times [2021-11-09 08:58:28,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:28,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405345247] [2021-11-09 08:58:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:28,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:29,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:29,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405345247] [2021-11-09 08:58:29,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405345247] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:29,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524344799] [2021-11-09 08:58:29,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 08:58:29,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:29,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:58:29,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:58:30,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-09 08:58:30,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-09 08:58:30,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 08:58:30,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-09 08:58:30,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:58:31,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-11-09 08:58:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-09 08:58:31,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524344799] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:31,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:58:31,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 30 [2021-11-09 08:58:31,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84791522] [2021-11-09 08:58:31,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-09 08:58:31,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-09 08:58:31,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-11-09 08:58:31,633 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 223 [2021-11-09 08:58:31,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 269 transitions, 1239 flow. Second operand has 30 states, 30 states have (on average 115.56666666666666) internal successors, (3467), 30 states have internal predecessors, (3467), 0 states have call successors, (0), 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-09 08:58:31,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:31,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 223 [2021-11-09 08:58:31,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:36,090 INFO L129 PetriNetUnfolder]: 4250/10286 cut-off events. [2021-11-09 08:58:36,091 INFO L130 PetriNetUnfolder]: For 41201/41534 co-relation queries the response was YES. [2021-11-09 08:58:36,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32239 conditions, 10286 events. 4250/10286 cut-off events. For 41201/41534 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 94009 event pairs, 371 based on Foata normal form. 157/9539 useless extension candidates. Maximal degree in co-relation 29596. Up to 3451 conditions per place. [2021-11-09 08:58:36,257 INFO L132 encePairwiseOnDemand]: 187/223 looper letters, 233 selfloop transitions, 116 changer transitions 7/451 dead transitions. [2021-11-09 08:58:36,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 451 transitions, 2932 flow [2021-11-09 08:58:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-09 08:58:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-11-09 08:58:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 5891 transitions. [2021-11-09 08:58:36,269 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.517981183504792 [2021-11-09 08:58:36,269 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 5891 transitions. [2021-11-09 08:58:36,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 5891 transitions. [2021-11-09 08:58:36,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:36,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 5891 transitions. [2021-11-09 08:58:36,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 115.50980392156863) internal successors, (5891), 51 states have internal predecessors, (5891), 0 states have call successors, (0), 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-09 08:58:36,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 223.0) internal successors, (11596), 52 states have internal predecessors, (11596), 0 states have call successors, (0), 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-09 08:58:36,307 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 223.0) internal successors, (11596), 52 states have internal predecessors, (11596), 0 states have call successors, (0), 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-09 08:58:36,307 INFO L186 Difference]: Start difference. First operand has 268 places, 269 transitions, 1239 flow. Second operand 51 states and 5891 transitions. [2021-11-09 08:58:36,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 451 transitions, 2932 flow [2021-11-09 08:58:36,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 451 transitions, 2910 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-11-09 08:58:36,473 INFO L242 Difference]: Finished difference. Result has 331 places, 321 transitions, 2022 flow [2021-11-09 08:58:36,474 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=2022, PETRI_PLACES=331, PETRI_TRANSITIONS=321} [2021-11-09 08:58:36,474 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 130 predicate places. [2021-11-09 08:58:36,474 INFO L470 AbstractCegarLoop]: Abstraction has has 331 places, 321 transitions, 2022 flow [2021-11-09 08:58:36,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 115.56666666666666) internal successors, (3467), 30 states have internal predecessors, (3467), 0 states have call successors, (0), 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-09 08:58:36,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:36,476 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:58:36,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-09 08:58:36,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:36,704 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-09 08:58:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 841172688, now seen corresponding path program 4 times [2021-11-09 08:58:36,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:36,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460035080] [2021-11-09 08:58:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:36,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:38,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:38,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460035080] [2021-11-09 08:58:38,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460035080] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:38,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353355804] [2021-11-09 08:58:38,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 08:58:38,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:58:38,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:58:38,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-09 08:58:38,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 08:58:38,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 08:58:38,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-09 08:58:38,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:58:40,525 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-09 08:58:40,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-09 08:58:40,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-11-09 08:58:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 08:58:40,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353355804] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:40,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:58:40,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 40 [2021-11-09 08:58:40,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942950406] [2021-11-09 08:58:40,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-09 08:58:40,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:58:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-09 08:58:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2021-11-09 08:58:40,808 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223 [2021-11-09 08:58:40,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 321 transitions, 2022 flow. Second operand has 40 states, 40 states have (on average 94.975) internal successors, (3799), 40 states have internal predecessors, (3799), 0 states have call successors, (0), 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-09 08:58:40,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:58:40,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223 [2021-11-09 08:58:40,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:58:55,275 INFO L129 PetriNetUnfolder]: 17151/36533 cut-off events. [2021-11-09 08:58:55,275 INFO L130 PetriNetUnfolder]: For 174118/174939 co-relation queries the response was YES. [2021-11-09 08:58:55,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117353 conditions, 36533 events. 17151/36533 cut-off events. For 174118/174939 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 382056 event pairs, 4785 based on Foata normal form. 62/33164 useless extension candidates. Maximal degree in co-relation 117277. Up to 11703 conditions per place. [2021-11-09 08:58:56,065 INFO L132 encePairwiseOnDemand]: 184/223 looper letters, 352 selfloop transitions, 178 changer transitions 18/625 dead transitions. [2021-11-09 08:58:56,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 625 transitions, 5313 flow [2021-11-09 08:58:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-11-09 08:58:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-11-09 08:58:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 7204 transitions. [2021-11-09 08:58:56,080 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.42506490441350014 [2021-11-09 08:58:56,081 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 7204 transitions. [2021-11-09 08:58:56,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 7204 transitions. [2021-11-09 08:58:56,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:58:56,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 7204 transitions. [2021-11-09 08:58:56,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 94.78947368421052) internal successors, (7204), 76 states have internal predecessors, (7204), 0 states have call successors, (0), 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-09 08:58:56,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 223.0) internal successors, (17171), 77 states have internal predecessors, (17171), 0 states have call successors, (0), 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-09 08:58:56,126 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 223.0) internal successors, (17171), 77 states have internal predecessors, (17171), 0 states have call successors, (0), 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-09 08:58:56,127 INFO L186 Difference]: Start difference. First operand has 331 places, 321 transitions, 2022 flow. Second operand 76 states and 7204 transitions. [2021-11-09 08:58:56,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 625 transitions, 5313 flow [2021-11-09 08:58:57,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 625 transitions, 5069 flow, removed 93 selfloop flow, removed 22 redundant places. [2021-11-09 08:58:57,784 INFO L242 Difference]: Finished difference. Result has 393 places, 406 transitions, 3155 flow [2021-11-09 08:58:57,785 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=3155, PETRI_PLACES=393, PETRI_TRANSITIONS=406} [2021-11-09 08:58:57,785 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 192 predicate places. [2021-11-09 08:58:57,785 INFO L470 AbstractCegarLoop]: Abstraction has has 393 places, 406 transitions, 3155 flow [2021-11-09 08:58:57,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 94.975) internal successors, (3799), 40 states have internal predecessors, (3799), 0 states have call successors, (0), 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-09 08:58:57,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:58:57,787 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:58:57,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-09 08:58:58,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:58,004 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-09 08:58:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:58:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 624871126, now seen corresponding path program 5 times [2021-11-09 08:58:58,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:58:58,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234073584] [2021-11-09 08:58:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:58:58,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:58:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:58:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:58:59,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:58:59,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234073584] [2021-11-09 08:58:59,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234073584] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:58:59,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5572925] [2021-11-09 08:58:59,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 08:58:59,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:58:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:58:59,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:58:59,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-09 08:59:00,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-11-09 08:59:00,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 08:59:00,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-09 08:59:00,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:59:01,788 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-09 08:59:01,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-09 08:59:01,948 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-09 08:59:01,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-09 08:59:02,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-11-09 08:59:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 08:59:02,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5572925] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:59:02,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:59:02,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2021-11-09 08:59:02,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818581823] [2021-11-09 08:59:02,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-09 08:59:02,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:59:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-09 08:59:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1804, Unknown=0, NotChecked=0, Total=1980 [2021-11-09 08:59:02,705 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 223 [2021-11-09 08:59:02,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 406 transitions, 3155 flow. Second operand has 45 states, 45 states have (on average 89.57777777777778) internal successors, (4031), 45 states have internal predecessors, (4031), 0 states have call successors, (0), 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-09 08:59:02,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:59:02,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 223 [2021-11-09 08:59:02,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:59:28,479 INFO L129 PetriNetUnfolder]: 39847/73606 cut-off events. [2021-11-09 08:59:28,479 INFO L130 PetriNetUnfolder]: For 382271/384350 co-relation queries the response was YES. [2021-11-09 08:59:29,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245580 conditions, 73606 events. 39847/73606 cut-off events. For 382271/384350 co-relation queries the response was YES. Maximal size of possible extension queue 2935. Compared 751385 event pairs, 9069 based on Foata normal form. 152/68051 useless extension candidates. Maximal degree in co-relation 245489. Up to 25944 conditions per place. [2021-11-09 08:59:29,812 INFO L132 encePairwiseOnDemand]: 183/223 looper letters, 541 selfloop transitions, 298 changer transitions 26/939 dead transitions. [2021-11-09 08:59:29,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 939 transitions, 8687 flow [2021-11-09 08:59:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-09 08:59:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-11-09 08:59:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 8744 transitions. [2021-11-09 08:59:29,829 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4084454409566517 [2021-11-09 08:59:29,830 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 8744 transitions. [2021-11-09 08:59:29,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 8744 transitions. [2021-11-09 08:59:29,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:59:29,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 8744 transitions. [2021-11-09 08:59:29,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 91.08333333333333) internal successors, (8744), 96 states have internal predecessors, (8744), 0 states have call successors, (0), 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-09 08:59:29,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 223.0) internal successors, (21631), 97 states have internal predecessors, (21631), 0 states have call successors, (0), 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-09 08:59:29,878 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 223.0) internal successors, (21631), 97 states have internal predecessors, (21631), 0 states have call successors, (0), 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-09 08:59:29,878 INFO L186 Difference]: Start difference. First operand has 393 places, 406 transitions, 3155 flow. Second operand 96 states and 8744 transitions. [2021-11-09 08:59:29,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 939 transitions, 8687 flow [2021-11-09 08:59:33,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 939 transitions, 8444 flow, removed 32 selfloop flow, removed 57 redundant places. [2021-11-09 08:59:33,601 INFO L242 Difference]: Finished difference. Result has 454 places, 555 transitions, 5795 flow [2021-11-09 08:59:33,602 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2932, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=5795, PETRI_PLACES=454, PETRI_TRANSITIONS=555} [2021-11-09 08:59:33,602 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 253 predicate places. [2021-11-09 08:59:33,602 INFO L470 AbstractCegarLoop]: Abstraction has has 454 places, 555 transitions, 5795 flow [2021-11-09 08:59:33,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 89.57777777777778) internal successors, (4031), 45 states have internal predecessors, (4031), 0 states have call successors, (0), 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-09 08:59:33,603 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:59:33,604 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:59:33,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-09 08:59:33,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:59:33,816 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-09 08:59:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:59:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1173873330, now seen corresponding path program 6 times [2021-11-09 08:59:33,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:59:33,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189319040] [2021-11-09 08:59:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:59:33,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:59:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:59:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:59:35,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:59:35,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189319040] [2021-11-09 08:59:35,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189319040] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:59:35,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506406129] [2021-11-09 08:59:35,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 08:59:35,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:59:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:59:35,294 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:59:35,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-09 08:59:36,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-11-09 08:59:36,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 08:59:36,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-09 08:59:36,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:59:37,621 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-09 08:59:38,967 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-09 08:59:39,182 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-09 08:59:39,595 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-09 08:59:39,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-09 08:59:39,833 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-09 08:59:39,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-09 08:59:40,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-09 08:59:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:59:40,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506406129] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:59:40,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:59:40,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 54 [2021-11-09 08:59:40,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873437871] [2021-11-09 08:59:40,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-11-09 08:59:40,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:59:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-11-09 08:59:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2643, Unknown=0, NotChecked=0, Total=2862 [2021-11-09 08:59:40,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223 [2021-11-09 08:59:40,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 555 transitions, 5795 flow. Second operand has 54 states, 54 states have (on average 98.38888888888889) internal successors, (5313), 54 states have internal predecessors, (5313), 0 states have call successors, (0), 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-09 08:59:40,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:59:40,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223 [2021-11-09 08:59:40,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:59:53,824 INFO L129 PetriNetUnfolder]: 9824/22112 cut-off events. [2021-11-09 08:59:53,824 INFO L130 PetriNetUnfolder]: For 440143/442004 co-relation queries the response was YES. [2021-11-09 08:59:54,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109796 conditions, 22112 events. 9824/22112 cut-off events. For 440143/442004 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 223812 event pairs, 1537 based on Foata normal form. 481/20378 useless extension candidates. Maximal degree in co-relation 109685. Up to 6356 conditions per place. [2021-11-09 08:59:54,362 INFO L132 encePairwiseOnDemand]: 190/223 looper letters, 374 selfloop transitions, 248 changer transitions 7/717 dead transitions. [2021-11-09 08:59:54,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 717 transitions, 8803 flow [2021-11-09 08:59:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-09 08:59:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-11-09 08:59:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4616 transitions. [2021-11-09 08:59:54,373 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4499902515110158 [2021-11-09 08:59:54,373 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4616 transitions. [2021-11-09 08:59:54,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4616 transitions. [2021-11-09 08:59:54,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 08:59:54,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4616 transitions. [2021-11-09 08:59:54,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 100.34782608695652) internal successors, (4616), 46 states have internal predecessors, (4616), 0 states have call successors, (0), 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-09 08:59:54,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 223.0) internal successors, (10481), 47 states have internal predecessors, (10481), 0 states have call successors, (0), 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-09 08:59:54,399 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 223.0) internal successors, (10481), 47 states have internal predecessors, (10481), 0 states have call successors, (0), 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-09 08:59:54,400 INFO L186 Difference]: Start difference. First operand has 454 places, 555 transitions, 5795 flow. Second operand 46 states and 4616 transitions. [2021-11-09 08:59:54,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 717 transitions, 8803 flow [2021-11-09 08:59:55,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 717 transitions, 8242 flow, removed 236 selfloop flow, removed 46 redundant places. [2021-11-09 08:59:55,937 INFO L242 Difference]: Finished difference. Result has 451 places, 602 transitions, 6792 flow [2021-11-09 08:59:55,939 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=5284, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=6792, PETRI_PLACES=451, PETRI_TRANSITIONS=602} [2021-11-09 08:59:55,939 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 250 predicate places. [2021-11-09 08:59:55,939 INFO L470 AbstractCegarLoop]: Abstraction has has 451 places, 602 transitions, 6792 flow [2021-11-09 08:59:55,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 98.38888888888889) internal successors, (5313), 54 states have internal predecessors, (5313), 0 states have call successors, (0), 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-09 08:59:55,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 08:59:55,941 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:59:55,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-09 08:59:56,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-09 08:59:56,156 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-09 08:59:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:59:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2109388946, now seen corresponding path program 7 times [2021-11-09 08:59:56,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:59:56,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871561138] [2021-11-09 08:59:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:59:56,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:59:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:59:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-09 08:59:56,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:59:56,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871561138] [2021-11-09 08:59:56,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871561138] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:59:56,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699377531] [2021-11-09 08:59:56,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 08:59:56,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 08:59:56,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:59:56,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 08:59:56,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-09 08:59:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:59:57,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-09 08:59:57,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:59:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-09 08:59:58,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699377531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 08:59:58,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 08:59:58,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-11-09 08:59:58,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98255021] [2021-11-09 08:59:58,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 08:59:58,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:59:58,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 08:59:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-09 08:59:58,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 223 [2021-11-09 08:59:58,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 602 transitions, 6792 flow. Second operand has 13 states, 13 states have (on average 177.53846153846155) internal successors, (2308), 13 states have internal predecessors, (2308), 0 states have call successors, (0), 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-09 08:59:58,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 08:59:58,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 223 [2021-11-09 08:59:58,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 08:59:59,927 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([807] thread2EXIT-->L145-2: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar1_4 0) (= v_thread2Thread1of1ForFork3_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem37_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork3_thidvar2_4 0)) InVars {thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_4, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_4, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_4, ULTIMATE.start_main_#t~mem37=|v_ULTIMATE.start_main_#t~mem37_5|} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_4, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_4, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_4, ULTIMATE.start_main_#t~mem37=|v_ULTIMATE.start_main_#t~mem37_5|} AuxVars[] AssignedVars[][351], [Black: 251#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 243#(<= ~q1_front~0 ~q1_back~0), 18#L92true, Black: 878#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 276#true, Black: 890#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 852#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 268#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 880#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~C~0)), Black: 884#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= 1 ~C~0)), Black: 892#(and (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), 39#L145-2true, Black: 295#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 848#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 854#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 886#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), Black: 1553#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 952#(and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (and (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0) (not (= |ULTIMATE.start_main_~#t4~0.base| ~q1~0.base)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|))), Black: 954#(<= 1 ~total~0), Black: 1557#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1555#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 2986#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), Black: 2940#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0)), Black: 3743#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 2988#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), 249#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3557#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< 0 ~total~0)), Black: 2942#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 2954#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 3030#(and (= ~q1~0.offset 0) (or (and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0))), Black: 2870#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (<= (+ ULTIMATE.start_create_fresh_int_array_~size 1) (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0)) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ULTIMATE.start_create_fresh_int_array_~size ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size| ~n1~0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 3727#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), Black: 2928#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0)), Black: 3032#(<= 1 ~total~0), Black: 1599#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 0) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 1597#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 3745#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3737#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), 114#L110true, Black: 3725#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 3009#true, 1603#true, Black: 3703#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 4479#true, Black: 3721#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3715#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3751#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3749#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3731#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3747#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3733#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3729#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3741#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 1625#(<= 1 ~total~0), Black: 3713#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 2206#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#t~post41| ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 2275#true, Black: 2192#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 3796#true, Black: 2234#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2250#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 2246#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2244#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0)), 226#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 1623#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2210#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 932#true, Black: 1624#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 225#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 234#(and (= ~i~0 0) (<= 1 ~N~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 4461#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< ~q1_front~0 ~n1~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 4471#(and (< 0 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 3819#(or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4469#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 4467#(and (or (< 0 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))) (or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 4465#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2)), Black: 253#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))]) [2021-11-09 08:59:59,927 INFO L384 tUnfolder$Statistics]: this new event has 174 ancestors and is not cut-off event [2021-11-09 08:59:59,928 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is not cut-off event [2021-11-09 08:59:59,928 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is not cut-off event [2021-11-09 08:59:59,928 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is not cut-off event [2021-11-09 09:00:00,260 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread4EXIT-->L147-2: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork2_thidvar0_4) (= 0 v_thread4Thread1of1ForFork2_thidvar2_4) (= 0 v_thread4Thread1of1ForFork2_thidvar3_4) (= 0 v_thread4Thread1of1ForFork2_thidvar4_4)) InVars {thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem39=|v_ULTIMATE.start_main_#t~mem39_5|} OutVars{thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem39=|v_ULTIMATE.start_main_#t~mem39_5|} AuxVars[] AssignedVars[][603], [Black: 251#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 249#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 243#(<= ~q1_front~0 ~q1_back~0), Black: 878#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 276#true, Black: 890#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), 65#L147-2true, Black: 852#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 268#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 880#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~C~0)), Black: 884#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= 1 ~C~0)), Black: 892#(and (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 295#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 848#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 854#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 886#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), Black: 1553#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 952#(and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (and (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0) (not (= |ULTIMATE.start_main_~#t4~0.base| ~q1~0.base)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|))), Black: 954#(<= 1 ~total~0), Black: 1557#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1555#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 2986#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), Black: 2940#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0)), Black: 2988#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), Black: 3743#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3557#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< 0 ~total~0)), Black: 2942#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 2954#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 3030#(and (= ~q1~0.offset 0) (or (and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0))), Black: 2870#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (<= (+ ULTIMATE.start_create_fresh_int_array_~size 1) (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0)) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ULTIMATE.start_create_fresh_int_array_~size ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size| ~n1~0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 3727#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), Black: 2928#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0)), Black: 1599#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 0) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 3032#(<= 1 ~total~0), Black: 1597#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 3745#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3737#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), Black: 3725#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 3009#true, 1603#true, Black: 3703#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 4479#true, Black: 3721#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3715#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3751#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3749#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3731#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3747#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3733#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3729#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3741#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 1625#(<= 1 ~total~0), Black: 3713#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 2206#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#t~post41| ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 2275#true, Black: 2192#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 3796#true, Black: 2234#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2250#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 2246#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2244#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1623#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2210#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 932#true, Black: 1624#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 225#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 234#(and (= ~i~0 0) (<= 1 ~N~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 226#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 4461#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< ~q1_front~0 ~n1~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 4471#(and (< 0 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 3819#(or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4469#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 4467#(and (or (< 0 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))) (or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 4465#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2)), Black: 253#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))]) [2021-11-09 09:00:00,260 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is not cut-off event [2021-11-09 09:00:00,260 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2021-11-09 09:00:00,260 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2021-11-09 09:00:00,260 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2021-11-09 09:00:00,266 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread4EXIT-->L147-2: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork2_thidvar0_4) (= 0 v_thread4Thread1of1ForFork2_thidvar2_4) (= 0 v_thread4Thread1of1ForFork2_thidvar3_4) (= 0 v_thread4Thread1of1ForFork2_thidvar4_4)) InVars {thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem39=|v_ULTIMATE.start_main_#t~mem39_5|} OutVars{thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem39=|v_ULTIMATE.start_main_#t~mem39_5|} AuxVars[] AssignedVars[][603], [Black: 251#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 243#(<= ~q1_front~0 ~q1_back~0), Black: 878#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), 276#true, Black: 890#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), 65#L147-2true, Black: 852#(and (= ~total~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 268#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 880#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 ~C~0)), Black: 884#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= 1 ~C~0)), Black: 892#(and (< ~q1_back~0 2) (< 0 ~total~0) (<= 1 ~q1_back~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (< 0 ~N~0)), Black: 295#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 848#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 854#(and (= ~total~0 0) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ULTIMATE.start_create_fresh_int_array_~i~1 1)), Black: 886#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= 1 ~C~0)), Black: 1553#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 ~C~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 ~q1_front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 952#(and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (and (or (<= ~n1~0 1) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0) (not (= |ULTIMATE.start_main_~#t4~0.base| ~q1~0.base)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|))), Black: 954#(<= 1 ~total~0), Black: 1557#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 1555#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (<= ~n1~0 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|)), Black: 2986#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), Black: 2940#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0)), Black: 2988#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t4~0.base|)), Black: 3743#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), 249#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3557#(and (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< 0 ~total~0)), Black: 2942#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 2954#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= |ULTIMATE.start_create_fresh_int_array_#t~post41| 0) (= ~q1~0.offset 0) (or (<= ~n1~0 2) (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 4)) (or (not (= 4 (+ (* 4 ~q1_back~0) ~q1~0.offset))) (<= 2 ~n1~0))), Black: 3030#(and (= ~q1~0.offset 0) (or (and (not (= |ULTIMATE.start_main_~#t2~0.base| ~q1~0.base)) (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0.base|)) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0)))) (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0))), Black: 2870#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (<= (+ ULTIMATE.start_create_fresh_int_array_~size 1) (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0)) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (<= ULTIMATE.start_create_fresh_int_array_~size ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size| ~n1~0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 3727#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), Black: 2928#(and (= ~total~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0)), Black: 1599#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 0) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 3032#(<= 1 ~total~0), Black: 1597#(and (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= ~n2~0 ULTIMATE.start_create_fresh_int_array_~size)), Black: 3745#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3737#(and (<= ~q1_front~0 ~q1_back~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= 1 ~q1_back~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 ~N~0)), Black: 3725#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 3009#true, 1603#true, Black: 3703#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), 4479#true, Black: 3721#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3715#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3751#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3749#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (or (= thread3Thread1of1ForFork0_~cond~2 1) (= thread3Thread1of1ForFork0_~cond~2 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< 0 ~total~0) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3731#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3747#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3733#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3729#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (or (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 0) (and (or (<= (+ (* 4 ~q1_back~0) ~q1~0.offset) 7) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= 4 (+ (* 4 ~q1_front~0) ~q1~0.offset)))) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ (* 4 ~q1_front~0) ~q1~0.offset) 0))))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 3741#(and (<= 1 ~total~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ULTIMATE.start_create_fresh_int_array_~i~1 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 1625#(<= 1 ~total~0), Black: 3713#(and (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~total~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res.base| 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< (+ ULTIMATE.start_create_fresh_int_array_~arr~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (or (<= ~n1~0 ~q1_front~0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (< 0 ~N~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0.base|)), Black: 2206#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#t~post41| ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 2275#true, Black: 2192#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 1))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 3796#true, Black: 2234#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2250#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 2246#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 thread3Thread1of1ForFork0_~cond~2) (or (<= ~q1_back~0 0) (and (= ~q1~0.offset 0) (<= (+ (* 4 ~q1_front~0) ~q1~0.offset) 4)) (<= (+ ~n1~0 1) ~q1_back~0))), Black: 2244#(and (= ~total~0 0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1623#(or (<= 1 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2210#(and (= ~total~0 0) (or (<= ~q1_front~0 0) (<= (+ ULTIMATE.start_create_fresh_int_array_~i~1 ~n1~0) (+ ULTIMATE.start_create_fresh_int_array_~size 2))) (= ULTIMATE.start_create_fresh_int_array_~arr~0.offset 0) (or (<= ~q1_front~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size|)) (or (<= ~q1_front~0 0) (<= ~n1~0 ULTIMATE.start_create_fresh_int_array_~size))), 932#true, Black: 1624#(or (<= 1 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))), Black: 225#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 234#(and (= ~i~0 0) (<= 1 ~N~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 226#(and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2)), Black: 4461#(and (= ~total~0 0) (<= 0 ~q1_front~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< ~q1_front~0 ~n1~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (<= 1 ~C~0)), Black: 4471#(and (< 0 ~total~0) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 3819#(or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 4469#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 4467#(and (or (< 0 ~total~0) (and (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))) (or (< 0 ~total~0) (<= (+ ~q1_front~0 1) ~q1_back~0))), Black: 4465#(and (< 0 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t2~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0.base|) (<= ~n1~0 2)), Black: 253#(and (<= ~q1_front~0 ~q1_back~0) (<= (div thread3Thread1of1ForFork0_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork0_~cond~2))]) [2021-11-09 09:00:00,266 INFO L384 tUnfolder$Statistics]: this new event has 188 ancestors and is not cut-off event [2021-11-09 09:00:00,266 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is not cut-off event [2021-11-09 09:00:00,266 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2021-11-09 09:00:00,266 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2021-11-09 09:00:00,271 INFO L129 PetriNetUnfolder]: 1067/6154 cut-off events. [2021-11-09 09:00:00,271 INFO L130 PetriNetUnfolder]: For 102941/104128 co-relation queries the response was YES. [2021-11-09 09:00:00,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24169 conditions, 6154 events. 1067/6154 cut-off events. For 102941/104128 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 68096 event pairs, 112 based on Foata normal form. 96/5589 useless extension candidates. Maximal degree in co-relation 24073. Up to 1014 conditions per place. [2021-11-09 09:00:00,395 INFO L132 encePairwiseOnDemand]: 209/223 looper letters, 268 selfloop transitions, 31 changer transitions 17/611 dead transitions. [2021-11-09 09:00:00,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 611 transitions, 7451 flow [2021-11-09 09:00:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-09 09:00:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-09 09:00:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2501 transitions. [2021-11-09 09:00:00,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8010890454836643 [2021-11-09 09:00:00,400 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2501 transitions. [2021-11-09 09:00:00,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2501 transitions. [2021-11-09 09:00:00,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:00:00,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2501 transitions. [2021-11-09 09:00:00,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 178.64285714285714) internal successors, (2501), 14 states have internal predecessors, (2501), 0 states have call successors, (0), 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-09 09:00:00,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 223.0) internal successors, (3345), 15 states have internal predecessors, (3345), 0 states have call successors, (0), 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-09 09:00:00,410 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 223.0) internal successors, (3345), 15 states have internal predecessors, (3345), 0 states have call successors, (0), 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-09 09:00:00,410 INFO L186 Difference]: Start difference. First operand has 451 places, 602 transitions, 6792 flow. Second operand 14 states and 2501 transitions. [2021-11-09 09:00:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 611 transitions, 7451 flow [2021-11-09 09:00:00,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 611 transitions, 7176 flow, removed 6 selfloop flow, removed 44 redundant places. [2021-11-09 09:00:00,668 INFO L242 Difference]: Finished difference. Result has 420 places, 569 transitions, 6121 flow [2021-11-09 09:00:00,668 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=6204, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6121, PETRI_PLACES=420, PETRI_TRANSITIONS=569} [2021-11-09 09:00:00,669 INFO L334 CegarLoopForPetriNet]: 201 programPoint places, 219 predicate places. [2021-11-09 09:00:00,669 INFO L470 AbstractCegarLoop]: Abstraction has has 420 places, 569 transitions, 6121 flow [2021-11-09 09:00:00,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 177.53846153846155) internal successors, (2308), 13 states have internal predecessors, (2308), 0 states have call successors, (0), 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-09 09:00:00,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:00:00,669 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:00:00,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-09 09:00:00,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b139a00-fc7f-4b1a-8dd8-784e7277266f/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-09 09:00:00,872 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-09 09:00:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:00:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1566746681, now seen corresponding path program 8 times [2021-11-09 09:00:00,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:00:00,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189813138] [2021-11-09 09:00:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:00:00,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:00:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:00:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-09 09:00:01,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:00:01,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189813138] [2021-11-09 09:00:01,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189813138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:00:01,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:00:01,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:00:01,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166613541] [2021-11-09 09:00:01,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:00:01,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:00:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:00:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:00:01,118 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 223 [2021-11-09 09:00:01,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 569 transitions, 6121 flow. Second operand has 7 states, 7 states have (on average 155.42857142857142) internal successors, (1088), 7 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:00:01,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:00:01,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 223 [2021-11-09 09:00:01,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand