/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 08:23:47,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 08:23:47,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 08:23:47,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 08:23:47,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 08:23:47,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 08:23:47,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 08:23:47,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 08:23:47,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 08:23:47,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 08:23:47,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 08:23:47,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 08:23:47,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 08:23:47,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 08:23:47,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 08:23:47,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 08:23:47,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 08:23:47,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 08:23:47,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 08:23:47,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 08:23:47,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 08:23:47,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 08:23:47,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 08:23:47,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 08:23:47,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 08:23:47,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 08:23:47,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 08:23:47,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 08:23:47,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 08:23:47,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 08:23:47,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 08:23:47,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 08:23:47,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 08:23:47,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 08:23:47,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 08:23:47,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 08:23:47,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 08:23:47,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 08:23:47,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 08:23:47,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 08:23:47,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 08:23:47,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 08:23:47,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 08:23:47,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 08:23:47,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 08:23:47,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 08:23:47,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 08:23:47,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 08:23:47,765 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 08:23:47,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 08:23:47,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 08:23:47,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:23:47,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 08:23:47,767 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 08:23:47,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 08:23:47,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 08:23:47,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 08:23:47,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 08:23:47,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 08:23:47,962 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 08:23:47,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2022-01-19 08:23:48,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2506fc19e/968ce66bad754aa7a922e4e21c05714a/FLAG13af47e45 [2022-01-19 08:23:48,375 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 08:23:48,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2022-01-19 08:23:48,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2506fc19e/968ce66bad754aa7a922e4e21c05714a/FLAG13af47e45 [2022-01-19 08:23:48,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2506fc19e/968ce66bad754aa7a922e4e21c05714a [2022-01-19 08:23:48,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 08:23:48,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 08:23:48,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 08:23:48,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 08:23:48,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 08:23:48,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca48e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48, skipping insertion in model container [2022-01-19 08:23:48,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 08:23:48,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 08:23:48,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-01-19 08:23:48,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:23:48,572 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 08:23:48,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-01-19 08:23:48,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:23:48,601 INFO L208 MainTranslator]: Completed translation [2022-01-19 08:23:48,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48 WrapperNode [2022-01-19 08:23:48,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 08:23:48,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 08:23:48,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 08:23:48,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 08:23:48,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,636 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2022-01-19 08:23:48,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 08:23:48,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 08:23:48,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 08:23:48,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 08:23:48,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 08:23:48,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 08:23:48,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 08:23:48,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 08:23:48,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (1/1) ... [2022-01-19 08:23:48,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:23:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:23:48,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 08:23:48,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 08:23:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 08:23:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 08:23:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 08:23:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 08:23:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 08:23:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 08:23:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 08:23:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 08:23:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 08:23:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 08:23:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 08:23:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 08:23:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 08:23:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 08:23:48,716 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 08:23:48,832 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 08:23:48,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 08:23:49,200 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 08:23:49,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 08:23:49,328 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-19 08:23:49,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:23:49 BoogieIcfgContainer [2022-01-19 08:23:49,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 08:23:49,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 08:23:49,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 08:23:49,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 08:23:49,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 08:23:48" (1/3) ... [2022-01-19 08:23:49,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea410ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:23:49, skipping insertion in model container [2022-01-19 08:23:49,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:23:48" (2/3) ... [2022-01-19 08:23:49,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea410ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:23:49, skipping insertion in model container [2022-01-19 08:23:49,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:23:49" (3/3) ... [2022-01-19 08:23:49,335 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-01-19 08:23:49,338 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 08:23:49,338 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 08:23:49,338 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 08:23:49,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,379 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,380 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,384 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,386 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,386 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,387 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,387 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,387 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,387 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,396 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,397 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,398 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,399 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,400 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,403 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,403 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,404 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,405 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,405 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,405 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,405 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,405 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,408 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:23:49,410 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 08:23:49,444 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 08:23:49,448 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=false, 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 [2022-01-19 08:23:49,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 08:23:49,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2022-01-19 08:23:49,518 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2022-01-19 08:23:49,519 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:23:49,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2022-01-19 08:23:49,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2022-01-19 08:23:49,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2022-01-19 08:23:49,594 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2022-01-19 08:23:49,595 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:23:49,595 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:49,595 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:49,596 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)] === [2022-01-19 08:23:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2022-01-19 08:23:49,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:49,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649359816] [2022-01-19 08:23:49,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:49,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:23:49,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:49,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649359816] [2022-01-19 08:23:49,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649359816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:49,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:49,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 08:23:49,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804619606] [2022-01-19 08:23:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:49,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 08:23:49,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:49,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 08:23:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 08:23:49,905 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2022-01-19 08:23:49,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:49,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:49,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2022-01-19 08:23:49,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:50,018 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2022-01-19 08:23:50,018 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-01-19 08:23:50,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1720 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2022-01-19 08:23:50,026 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2022-01-19 08:23:50,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2022-01-19 08:23:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 08:23:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 08:23:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2022-01-19 08:23:50,047 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2022-01-19 08:23:50,048 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2022-01-19 08:23:50,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2022-01-19 08:23:50,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:50,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2022-01-19 08:23:50,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,062 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,064 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2022-01-19 08:23:50,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2022-01-19 08:23:50,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 08:23:50,079 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2022-01-19 08:23:50,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2022-01-19 08:23:50,086 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2022-01-19 08:23:50,086 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2022-01-19 08:23:50,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:50,087 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:50,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 08:23:50,088 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)] === [2022-01-19 08:23:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2022-01-19 08:23:50,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098023901] [2022-01-19 08:23:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:50,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:23:50,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:50,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098023901] [2022-01-19 08:23:50,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098023901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:50,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:50,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 08:23:50,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528905675] [2022-01-19 08:23:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:50,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 08:23:50,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 08:23:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 08:23:50,412 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2022-01-19 08:23:50,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:50,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2022-01-19 08:23:50,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:50,590 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2022-01-19 08:23:50,590 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-01-19 08:23:50,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1675 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2022-01-19 08:23:50,595 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2022-01-19 08:23:50,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2022-01-19 08:23:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 08:23:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 08:23:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2022-01-19 08:23:50,597 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2022-01-19 08:23:50,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2022-01-19 08:23:50,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2022-01-19 08:23:50,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:50,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2022-01-19 08:23:50,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,603 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2022-01-19 08:23:50,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2022-01-19 08:23:50,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 08:23:50,611 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2022-01-19 08:23:50,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2022-01-19 08:23:50,612 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-01-19 08:23:50,612 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2022-01-19 08:23:50,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:50,613 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:50,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 08:23:50,613 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)] === [2022-01-19 08:23:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2022-01-19 08:23:50,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:50,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685932775] [2022-01-19 08:23:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:50,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:23:50,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685932775] [2022-01-19 08:23:50,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685932775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:50,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:50,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 08:23:50,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905039858] [2022-01-19 08:23:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:50,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 08:23:50,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 08:23:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 08:23:50,715 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-01-19 08:23:50,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:50,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-01-19 08:23:50,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:50,819 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2022-01-19 08:23:50,819 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2022-01-19 08:23:50,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3026 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2022-01-19 08:23:50,824 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2022-01-19 08:23:50,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2022-01-19 08:23:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 08:23:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 08:23:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2022-01-19 08:23:50,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2022-01-19 08:23:50,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2022-01-19 08:23:50,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2022-01-19 08:23:50,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:50,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2022-01-19 08:23:50,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,829 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2022-01-19 08:23:50,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2022-01-19 08:23:50,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 08:23:50,833 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2022-01-19 08:23:50,834 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2022-01-19 08:23:50,835 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2022-01-19 08:23:50,835 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2022-01-19 08:23:50,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,836 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:50,836 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:50,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 08:23:50,836 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)] === [2022-01-19 08:23:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2022-01-19 08:23:50,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324385829] [2022-01-19 08:23:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:50,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:23:50,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:50,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324385829] [2022-01-19 08:23:50,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324385829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:50,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:50,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 08:23:50,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979083911] [2022-01-19 08:23:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:50,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 08:23:50,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 08:23:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 08:23:50,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-01-19 08:23:50,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:50,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:50,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-01-19 08:23:50,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:50,993 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2022-01-19 08:23:50,994 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2022-01-19 08:23:50,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2788 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2022-01-19 08:23:50,998 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2022-01-19 08:23:50,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2022-01-19 08:23:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 08:23:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 08:23:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2022-01-19 08:23:51,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2022-01-19 08:23:51,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2022-01-19 08:23:51,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2022-01-19 08:23:51,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:51,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2022-01-19 08:23:51,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,032 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2022-01-19 08:23:51,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2022-01-19 08:23:51,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 08:23:51,038 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2022-01-19 08:23:51,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2022-01-19 08:23:51,039 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-01-19 08:23:51,039 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2022-01-19 08:23:51,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,040 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:51,040 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:51,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 08:23:51,040 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)] === [2022-01-19 08:23:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2022-01-19 08:23:51,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:51,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655418715] [2022-01-19 08:23:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:51,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:23:51,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:51,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655418715] [2022-01-19 08:23:51,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655418715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:51,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:51,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 08:23:51,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802690042] [2022-01-19 08:23:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:51,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 08:23:51,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 08:23:51,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 08:23:51,115 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-01-19 08:23:51,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:51,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-01-19 08:23:51,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:51,283 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2022-01-19 08:23:51,283 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2022-01-19 08:23:51,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2942 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2022-01-19 08:23:51,287 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2022-01-19 08:23:51,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2022-01-19 08:23:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:23:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:23:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2022-01-19 08:23:51,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2022-01-19 08:23:51,290 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2022-01-19 08:23:51,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2022-01-19 08:23:51,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:51,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2022-01-19 08:23:51,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,297 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,298 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2022-01-19 08:23:51,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2022-01-19 08:23:51,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 08:23:51,302 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2022-01-19 08:23:51,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2022-01-19 08:23:51,303 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2022-01-19 08:23:51,303 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2022-01-19 08:23:51,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,303 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:51,303 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:51,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 08:23:51,304 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)] === [2022-01-19 08:23:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2022-01-19 08:23:51,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595790999] [2022-01-19 08:23:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:51,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:23:51,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595790999] [2022-01-19 08:23:51,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595790999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:51,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:51,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 08:23:51,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225351417] [2022-01-19 08:23:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:51,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 08:23:51,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 08:23:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 08:23:51,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-01-19 08:23:51,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:51,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-01-19 08:23:51,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:51,534 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2022-01-19 08:23:51,534 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2022-01-19 08:23:51,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4977 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2022-01-19 08:23:51,539 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2022-01-19 08:23:51,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2022-01-19 08:23:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:23:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:23:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2022-01-19 08:23:51,542 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2022-01-19 08:23:51,542 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2022-01-19 08:23:51,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2022-01-19 08:23:51,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:51,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2022-01-19 08:23:51,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,548 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,548 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2022-01-19 08:23:51,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2022-01-19 08:23:51,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 08:23:51,552 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2022-01-19 08:23:51,552 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2022-01-19 08:23:51,553 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2022-01-19 08:23:51,553 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2022-01-19 08:23:51,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,553 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:51,554 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:51,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 08:23:51,554 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)] === [2022-01-19 08:23:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2022-01-19 08:23:51,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:51,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869641897] [2022-01-19 08:23:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:51,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:23:51,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:51,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869641897] [2022-01-19 08:23:51,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869641897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:51,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:51,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:23:51,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891905811] [2022-01-19 08:23:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:51,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:23:51,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:23:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:23:51,727 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-01-19 08:23:51,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:51,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:51,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-01-19 08:23:51,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:52,953 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2022-01-19 08:23:52,953 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2022-01-19 08:23:52,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87639 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2022-01-19 08:23:52,999 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2022-01-19 08:23:52,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2022-01-19 08:23:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:23:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:23:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-01-19 08:23:53,002 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2022-01-19 08:23:53,002 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2022-01-19 08:23:53,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2022-01-19 08:23:53,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:53,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2022-01-19 08:23:53,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:53,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:53,008 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:53,008 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2022-01-19 08:23:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2022-01-19 08:23:53,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 08:23:53,016 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2022-01-19 08:23:53,017 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2022-01-19 08:23:53,017 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2022-01-19 08:23:53,017 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2022-01-19 08:23:53,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:53,018 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:53,018 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:53,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 08:23:53,018 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)] === [2022-01-19 08:23:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2022-01-19 08:23:53,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106610316] [2022-01-19 08:23:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:53,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:23:53,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106610316] [2022-01-19 08:23:53,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106610316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:53,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:53,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:23:53,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955703527] [2022-01-19 08:23:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:53,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:23:53,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:23:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:23:53,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-01-19 08:23:53,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:53,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:53,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-01-19 08:23:53,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:54,039 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2022-01-19 08:23:54,039 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2022-01-19 08:23:54,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2888/2926 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 63264 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2022-01-19 08:23:54,120 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2022-01-19 08:23:54,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2022-01-19 08:23:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:23:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:23:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2022-01-19 08:23:54,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2022-01-19 08:23:54,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2022-01-19 08:23:54,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2022-01-19 08:23:54,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:54,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2022-01-19 08:23:54,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:54,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:54,132 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:54,132 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2022-01-19 08:23:54,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2022-01-19 08:23:54,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 08:23:54,139 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2022-01-19 08:23:54,139 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2022-01-19 08:23:54,141 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2022-01-19 08:23:54,141 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2022-01-19 08:23:54,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:54,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:54,142 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:54,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 08:23:54,142 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)] === [2022-01-19 08:23:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2022-01-19 08:23:54,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:54,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898823902] [2022-01-19 08:23:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:54,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:23:54,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898823902] [2022-01-19 08:23:54,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898823902] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:23:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464787336] [2022-01-19 08:23:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:54,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:23:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:23:54,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:23:54,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 08:23:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:54,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 08:23:54,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:23:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 08:23:54,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:23:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:23:55,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464787336] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:23:55,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:23:55,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2022-01-19 08:23:55,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501504303] [2022-01-19 08:23:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:55,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 08:23:55,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 08:23:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-01-19 08:23:55,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2022-01-19 08:23:55,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:55,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:55,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2022-01-19 08:23:55,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:56,322 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2022-01-19 08:23:56,322 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2022-01-19 08:23:56,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 6652 events. 3111/6652 cut-off events. For 3365/3381 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 46322 event pairs, 179 based on Foata normal form. 200/6442 useless extension candidates. Maximal degree in co-relation 14575. Up to 885 conditions per place. [2022-01-19 08:23:56,351 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2022-01-19 08:23:56,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2022-01-19 08:23:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 08:23:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 08:23:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2022-01-19 08:23:56,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2022-01-19 08:23:56,357 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2022-01-19 08:23:56,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2022-01-19 08:23:56,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:56,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2022-01-19 08:23:56,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.1) internal successors, (3802), 20 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:56,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:56,369 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:56,369 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2022-01-19 08:23:56,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2022-01-19 08:23:56,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 355 transitions, 1335 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-01-19 08:23:56,381 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2022-01-19 08:23:56,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=790, PETRI_PLACES=276, PETRI_TRANSITIONS=256} [2022-01-19 08:23:56,382 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2022-01-19 08:23:56,382 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2022-01-19 08:23:56,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:56,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:56,383 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:56,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 08:23:56,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:23:56,600 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)] === [2022-01-19 08:23:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2022-01-19 08:23:56,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:56,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640800876] [2022-01-19 08:23:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:56,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 08:23:56,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640800876] [2022-01-19 08:23:56,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640800876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:56,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:56,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 08:23:56,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535138461] [2022-01-19 08:23:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:56,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:23:56,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:23:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 08:23:56,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-01-19 08:23:56,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 256 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:56,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:56,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-01-19 08:23:56,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:57,459 INFO L129 PetriNetUnfolder]: 2365/4801 cut-off events. [2022-01-19 08:23:57,459 INFO L130 PetriNetUnfolder]: For 9509/9509 co-relation queries the response was YES. [2022-01-19 08:23:57,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12699 conditions, 4801 events. 2365/4801 cut-off events. For 9509/9509 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31209 event pairs, 396 based on Foata normal form. 134/4536 useless extension candidates. Maximal degree in co-relation 12677. Up to 1800 conditions per place. [2022-01-19 08:23:57,487 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 116 selfloop transitions, 15 changer transitions 7/300 dead transitions. [2022-01-19 08:23:57,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 300 transitions, 1264 flow [2022-01-19 08:23:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:23:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:23:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1755 transitions. [2022-01-19 08:23:57,490 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2022-01-19 08:23:57,491 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1755 transitions. [2022-01-19 08:23:57,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1755 transitions. [2022-01-19 08:23:57,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:57,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1755 transitions. [2022-01-19 08:23:57,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,496 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,496 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1755 transitions. [2022-01-19 08:23:57,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 300 transitions, 1264 flow [2022-01-19 08:23:57,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 300 transitions, 1191 flow, removed 9 selfloop flow, removed 12 redundant places. [2022-01-19 08:23:57,517 INFO L242 Difference]: Finished difference. Result has 272 places, 258 transitions, 798 flow [2022-01-19 08:23:57,518 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=798, PETRI_PLACES=272, PETRI_TRANSITIONS=258} [2022-01-19 08:23:57,518 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2022-01-19 08:23:57,518 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 258 transitions, 798 flow [2022-01-19 08:23:57,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,519 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:57,519 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:57,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 08:23:57,519 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)] === [2022-01-19 08:23:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 195790739, now seen corresponding path program 1 times [2022-01-19 08:23:57,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349094726] [2022-01-19 08:23:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:57,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 08:23:57,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349094726] [2022-01-19 08:23:57,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349094726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:23:57,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:23:57,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 08:23:57,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949476367] [2022-01-19 08:23:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:57,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 08:23:57,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 08:23:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 08:23:57,587 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2022-01-19 08:23:57,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 258 transitions, 798 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:57,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2022-01-19 08:23:57,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:57,871 INFO L129 PetriNetUnfolder]: 864/2281 cut-off events. [2022-01-19 08:23:57,871 INFO L130 PetriNetUnfolder]: For 5799/5850 co-relation queries the response was YES. [2022-01-19 08:23:57,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 2281 events. 864/2281 cut-off events. For 5799/5850 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14496 event pairs, 74 based on Foata normal form. 26/2075 useless extension candidates. Maximal degree in co-relation 6372. Up to 538 conditions per place. [2022-01-19 08:23:57,892 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 63 selfloop transitions, 23 changer transitions 0/302 dead transitions. [2022-01-19 08:23:57,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 302 transitions, 1200 flow [2022-01-19 08:23:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 08:23:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 08:23:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2022-01-19 08:23:57,895 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2022-01-19 08:23:57,895 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2022-01-19 08:23:57,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2022-01-19 08:23:57,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:57,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2022-01-19 08:23:57,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,900 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,900 INFO L186 Difference]: Start difference. First operand has 272 places, 258 transitions, 798 flow. Second operand 6 states and 1425 transitions. [2022-01-19 08:23:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 302 transitions, 1200 flow [2022-01-19 08:23:57,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 302 transitions, 1159 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-01-19 08:23:57,909 INFO L242 Difference]: Finished difference. Result has 271 places, 270 transitions, 953 flow [2022-01-19 08:23:57,909 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2022-01-19 08:23:57,909 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 32 predicate places. [2022-01-19 08:23:57,909 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 953 flow [2022-01-19 08:23:57,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:57,910 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:23:57,910 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:23:57,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 08:23:57,910 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)] === [2022-01-19 08:23:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:23:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash -514632839, now seen corresponding path program 1 times [2022-01-19 08:23:57,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:23:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637657968] [2022-01-19 08:23:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:57,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:23:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 08:23:57,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:23:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637657968] [2022-01-19 08:23:57,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637657968] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:23:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65395481] [2022-01-19 08:23:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:23:57,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:23:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:23:57,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:23:57,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 08:23:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:23:58,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 08:23:58,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:23:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 08:23:58,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:23:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 08:23:58,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65395481] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:23:58,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:23:58,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 11 [2022-01-19 08:23:58,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301056907] [2022-01-19 08:23:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:23:58,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 08:23:58,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:23:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 08:23:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 08:23:58,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-01-19 08:23:58,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:23:58,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:23:58,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-01-19 08:23:58,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:24:00,134 INFO L129 PetriNetUnfolder]: 4525/9682 cut-off events. [2022-01-19 08:24:00,134 INFO L130 PetriNetUnfolder]: For 45844/46244 co-relation queries the response was YES. [2022-01-19 08:24:00,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32947 conditions, 9682 events. 4525/9682 cut-off events. For 45844/46244 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 83372 event pairs, 699 based on Foata normal form. 54/8446 useless extension candidates. Maximal degree in co-relation 32922. Up to 2009 conditions per place. [2022-01-19 08:24:00,228 INFO L132 encePairwiseOnDemand]: 253/265 looper letters, 150 selfloop transitions, 56 changer transitions 0/414 dead transitions. [2022-01-19 08:24:00,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 414 transitions, 2463 flow [2022-01-19 08:24:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 08:24:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 08:24:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2529 transitions. [2022-01-19 08:24:00,233 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8675814751286449 [2022-01-19 08:24:00,233 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2529 transitions. [2022-01-19 08:24:00,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2529 transitions. [2022-01-19 08:24:00,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:24:00,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2529 transitions. [2022-01-19 08:24:00,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 229.9090909090909) internal successors, (2529), 11 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:00,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:00,242 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:00,242 INFO L186 Difference]: Start difference. First operand has 271 places, 270 transitions, 953 flow. Second operand 11 states and 2529 transitions. [2022-01-19 08:24:00,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 414 transitions, 2463 flow [2022-01-19 08:24:00,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 414 transitions, 2403 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-01-19 08:24:00,326 INFO L242 Difference]: Finished difference. Result has 285 places, 309 transitions, 1456 flow [2022-01-19 08:24:00,326 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1456, PETRI_PLACES=285, PETRI_TRANSITIONS=309} [2022-01-19 08:24:00,327 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 46 predicate places. [2022-01-19 08:24:00,327 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 309 transitions, 1456 flow [2022-01-19 08:24:00,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:00,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:24:00,328 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:24:00,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 08:24:00,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 08:24:00,543 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:24:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:24:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 778151649, now seen corresponding path program 2 times [2022-01-19 08:24:00,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:24:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936416968] [2022-01-19 08:24:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:24:00,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:24:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:24:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 08:24:00,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:24:00,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936416968] [2022-01-19 08:24:00,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936416968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:24:00,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:24:00,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 08:24:00,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020702027] [2022-01-19 08:24:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:24:00,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:24:00,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:24:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:24:00,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 08:24:00,714 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-01-19 08:24:00,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 309 transitions, 1456 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:00,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:24:00,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-01-19 08:24:00,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:24:02,692 INFO L129 PetriNetUnfolder]: 7558/14275 cut-off events. [2022-01-19 08:24:02,693 INFO L130 PetriNetUnfolder]: For 59580/59619 co-relation queries the response was YES. [2022-01-19 08:24:02,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 14275 events. 7558/14275 cut-off events. For 59580/59619 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 115295 event pairs, 2183 based on Foata normal form. 251/13713 useless extension candidates. Maximal degree in co-relation 51645. Up to 7112 conditions per place. [2022-01-19 08:24:02,800 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 219 selfloop transitions, 18 changer transitions 0/408 dead transitions. [2022-01-19 08:24:02,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 408 transitions, 2781 flow [2022-01-19 08:24:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:24:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:24:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2022-01-19 08:24:02,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2022-01-19 08:24:02,803 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2022-01-19 08:24:02,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2022-01-19 08:24:02,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:24:02,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2022-01-19 08:24:02,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:02,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:02,809 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:02,809 INFO L186 Difference]: Start difference. First operand has 285 places, 309 transitions, 1456 flow. Second operand 9 states and 1751 transitions. [2022-01-19 08:24:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 408 transitions, 2781 flow [2022-01-19 08:24:03,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 408 transitions, 2758 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-01-19 08:24:03,006 INFO L242 Difference]: Finished difference. Result has 293 places, 315 transitions, 1549 flow [2022-01-19 08:24:03,007 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=293, PETRI_TRANSITIONS=315} [2022-01-19 08:24:03,007 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 54 predicate places. [2022-01-19 08:24:03,007 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 315 transitions, 1549 flow [2022-01-19 08:24:03,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:03,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:24:03,008 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:24:03,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 08:24:03,008 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:24:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:24:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1347663800, now seen corresponding path program 1 times [2022-01-19 08:24:03,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:24:03,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653809721] [2022-01-19 08:24:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:24:03,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:24:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:24:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:24:05,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:24:05,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653809721] [2022-01-19 08:24:05,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653809721] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:24:05,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018186083] [2022-01-19 08:24:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:24:05,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:24:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:24:05,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:24:05,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 08:24:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:24:05,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-19 08:24:05,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:24:10,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 08:24:10,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 08:24:10,215 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-19 08:24:10,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 31 [2022-01-19 08:24:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:24:10,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:24:11,280 INFO L353 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2022-01-19 08:24:11,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 269 [2022-01-19 08:24:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:24:23,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018186083] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:24:23,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:24:23,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 25] total 91 [2022-01-19 08:24:23,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084270496] [2022-01-19 08:24:23,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:24:23,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-19 08:24:23,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:24:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-19 08:24:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=6687, Unknown=0, NotChecked=0, Total=8190 [2022-01-19 08:24:23,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2022-01-19 08:24:23,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 315 transitions, 1549 flow. Second operand has 91 states, 91 states have (on average 109.98901098901099) internal successors, (10009), 91 states have internal predecessors, (10009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:23,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:24:23,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2022-01-19 08:24:23,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:24:30,454 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:30,454 INFO L384 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2022-01-19 08:24:30,454 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-01-19 08:24:30,454 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-01-19 08:24:30,454 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:31,445 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, 109#L82true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:31,445 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-01-19 08:24:31,445 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-01-19 08:24:31,445 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-01-19 08:24:31,446 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 08:24:33,740 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 40#L79true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:33,740 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-01-19 08:24:33,740 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:33,741 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:33,743 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:34,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:34,548 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-01-19 08:24:34,549 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:34,549 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 08:24:34,549 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 08:24:35,511 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), 24#L115true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:35,518 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-01-19 08:24:35,518 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-01-19 08:24:35,518 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 08:24:35,518 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-01-19 08:24:36,432 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:36,432 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,432 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:36,432 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:36,432 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,433 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:36,433 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,433 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:36,433 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:36,433 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:36,434 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,434 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:36,434 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 08:24:36,434 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 08:24:37,343 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:37,344 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 08:24:37,344 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:37,344 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 08:24:37,344 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:37,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:37,345 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 08:24:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 08:24:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 08:24:37,345 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 08:24:37,361 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:37,361 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 08:24:37,361 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:37,361 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:37,361 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 08:24:38,194 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:38,194 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-01-19 08:24:38,194 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 08:24:38,194 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 08:24:38,194 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-01-19 08:24:38,195 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:38,195 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-01-19 08:24:38,195 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 08:24:38,195 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-01-19 08:24:38,195 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 08:24:38,963 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:38,963 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 08:24:38,963 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,963 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 08:24:38,963 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,964 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:38,964 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 08:24:38,964 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,964 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 08:24:38,964 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,965 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:38,965 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 08:24:38,965 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,965 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 08:24:38,965 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 08:24:39,479 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:39,480 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-01-19 08:24:39,480 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-01-19 08:24:39,480 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:39,480 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 08:24:39,486 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:39,486 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-01-19 08:24:39,486 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 08:24:39,486 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-01-19 08:24:39,486 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 08:24:40,034 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:40,034 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-01-19 08:24:40,034 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 08:24:40,034 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 08:24:40,034 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 08:24:40,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:40,369 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-01-19 08:24:40,369 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 08:24:40,369 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-01-19 08:24:40,369 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 08:24:41,121 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:41,121 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-01-19 08:24:41,121 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 08:24:41,121 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 08:24:41,121 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-01-19 08:24:41,623 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 151#L146-1true, Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:41,624 INFO L384 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-01-19 08:24:41,624 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-01-19 08:24:41,624 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-01-19 08:24:41,624 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-01-19 08:24:42,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 228#L146-2true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:42,233 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-01-19 08:24:42,234 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-01-19 08:24:42,234 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-01-19 08:24:42,234 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-01-19 08:24:42,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 69#L147-1true, Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-01-19 08:24:42,339 INFO L384 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2022-01-19 08:24:42,339 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-01-19 08:24:42,339 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-01-19 08:24:42,339 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-01-19 08:24:42,850 INFO L129 PetriNetUnfolder]: 55321/103718 cut-off events. [2022-01-19 08:24:42,850 INFO L130 PetriNetUnfolder]: For 447193/449504 co-relation queries the response was YES. [2022-01-19 08:24:43,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379107 conditions, 103718 events. 55321/103718 cut-off events. For 447193/449504 co-relation queries the response was YES. Maximal size of possible extension queue 4184. Compared 1098930 event pairs, 2924 based on Foata normal form. 316/98668 useless extension candidates. Maximal degree in co-relation 379075. Up to 23137 conditions per place. [2022-01-19 08:24:44,250 INFO L132 encePairwiseOnDemand]: 191/265 looper letters, 702 selfloop transitions, 535 changer transitions 12/1355 dead transitions. [2022-01-19 08:24:44,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1355 transitions, 10485 flow [2022-01-19 08:24:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-19 08:24:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2022-01-19 08:24:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 10794 transitions. [2022-01-19 08:24:44,261 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4333199518265757 [2022-01-19 08:24:44,261 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 10794 transitions. [2022-01-19 08:24:44,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 10794 transitions. [2022-01-19 08:24:44,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:24:44,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 10794 transitions. [2022-01-19 08:24:44,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 114.82978723404256) internal successors, (10794), 94 states have internal predecessors, (10794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:44,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:44,300 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:44,300 INFO L186 Difference]: Start difference. First operand has 293 places, 315 transitions, 1549 flow. Second operand 94 states and 10794 transitions. [2022-01-19 08:24:44,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1355 transitions, 10485 flow [2022-01-19 08:24:50,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 1355 transitions, 10411 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 08:24:50,507 INFO L242 Difference]: Finished difference. Result has 442 places, 849 transitions, 8290 flow [2022-01-19 08:24:50,507 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=8290, PETRI_PLACES=442, PETRI_TRANSITIONS=849} [2022-01-19 08:24:50,508 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 203 predicate places. [2022-01-19 08:24:50,508 INFO L470 AbstractCegarLoop]: Abstraction has has 442 places, 849 transitions, 8290 flow [2022-01-19 08:24:50,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 109.98901098901099) internal successors, (10009), 91 states have internal predecessors, (10009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 08:24:50,510 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:24:50,510 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:24:50,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 08:24:50,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:24:50,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:24:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:24:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 996668130, now seen corresponding path program 2 times [2022-01-19 08:24:50,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:24:50,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548657763] [2022-01-19 08:24:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:24:50,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:24:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:24:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:24:54,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:24:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548657763] [2022-01-19 08:24:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548657763] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:24:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088903700] [2022-01-19 08:24:54,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 08:24:54,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:24:54,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:24:54,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:24:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 08:24:54,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:24:54,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:24:54,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 143 conjunts are in the unsatisfiable core [2022-01-19 08:24:54,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:24:54,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 08:24:54,531 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 08:24:54,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 08:24:54,621 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-19 08:24:54,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-01-19 08:24:54,722 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-19 08:24:54,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-01-19 08:24:56,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:24:56,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:24:56,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-01-19 08:24:57,578 INFO L387 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 [2022-01-19 08:25:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:00,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:00,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:00,271 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 08:25:00,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2022-01-19 08:25:01,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 08:25:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:06,303 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 08:25:06,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-01-19 08:25:07,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 08:25:09,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 08:25:10,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:10,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:10,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-01-19 08:25:11,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:11,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:11,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2022-01-19 08:25:13,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:13,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:13,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:25:13,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2022-01-19 08:25:17,967 INFO L353 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-01-19 08:25:17,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 21 [2022-01-19 08:25:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:25:18,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:26:08,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 08:26:08,134 INFO L353 Elim1Store]: treesize reduction 63, result has 50.4 percent of original size [2022-01-19 08:26:08,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 169 [2022-01-19 08:26:08,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 08:26:08,371 INFO L353 Elim1Store]: treesize reduction 85, result has 72.5 percent of original size [2022-01-19 08:26:08,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 926269 treesize of output 893620 [2022-01-19 08:26:12,074 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:26:12,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 892918 treesize of output 794630 [2022-01-19 08:26:14,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:26:14,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 794614 treesize of output 598022 [2022-01-19 08:26:15,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:26:15,894 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:26:15,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 598450 treesize of output 573962 [2022-01-19 08:26:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 08:26:17,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 08:26:17,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 573756 treesize of output 524556 [2022-01-19 08:26:29,704 WARN L228 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 637 DAG size of output: 637 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 08:26:46,766 WARN L228 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 604 DAG size of output: 604 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 08:26:55,970 WARN L228 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 580 DAG size of output: 580 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 08:27:06,841 WARN L228 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 571 DAG size of output: 571 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-01-19 08:37:59,369 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 08:37:59,370 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 08:37:59,370 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-19 08:37:59,372 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 08:37:59,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 08:37:59,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 08:37:59,583 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. [2022-01-19 08:37:59,585 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 08:37:59,585 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 08:37:59,585 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 08:37:59,585 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 08:37:59,587 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 08:37:59,588 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 08:37:59,588 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 08:37:59,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 08:37:59 BasicIcfg [2022-01-19 08:37:59,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 08:37:59,590 INFO L158 Benchmark]: Toolchain (without parser) took 851197.71ms. Allocated memory was 415.2MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 362.5MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. [2022-01-19 08:37:59,590 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 415.2MB. Free memory is still 379.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 08:37:59,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.62ms. Allocated memory is still 415.2MB. Free memory was 362.3MB in the beginning and 383.2MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2022-01-19 08:37:59,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.78ms. Allocated memory is still 415.2MB. Free memory was 383.2MB in the beginning and 380.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 08:37:59,591 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 415.2MB. Free memory was 380.0MB in the beginning and 377.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 08:37:59,591 INFO L158 Benchmark]: RCFGBuilder took 667.00ms. Allocated memory is still 415.2MB. Free memory was 377.9MB in the beginning and 333.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2022-01-19 08:37:59,591 INFO L158 Benchmark]: TraceAbstraction took 850259.12ms. Allocated memory was 415.2MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 333.4MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. [2022-01-19 08:37:59,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 415.2MB. Free memory is still 379.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 205.62ms. Allocated memory is still 415.2MB. Free memory was 362.3MB in the beginning and 383.2MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.78ms. Allocated memory is still 415.2MB. Free memory was 383.2MB in the beginning and 380.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 415.2MB. Free memory was 380.0MB in the beginning and 377.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 667.00ms. Allocated memory is still 415.2MB. Free memory was 377.9MB in the beginning and 333.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 850259.12ms. Allocated memory was 415.2MB in the beginning and 9.0GB in the end (delta: 8.6GB). Free memory was 333.4MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 6.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 151]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 226 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 115ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 276 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 850.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3437 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3437 mSDsluCounter, 4033 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1398 IncrementalHoareTripleChecker+Unchecked, 5138 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5232 IncrementalHoareTripleChecker+Invalid, 6922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 437 mSDtfsCounter, 5232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1561 GetRequests, 1257 SyntacticMatches, 20 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13202 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8290occurred in iteration=14, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 3554 NumberOfCodeBlocks, 3554 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4193 ConstructedInterpolants, 30 QuantifiedInterpolants, 40453 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1682 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 56/79 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown