/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-After.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 14:24:01,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 14:24:01,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 14:24:01,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 14:24:01,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 14:24:01,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 14:24:01,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 14:24:01,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 14:24:01,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 14:24:01,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 14:24:01,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 14:24:01,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 14:24:01,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 14:24:01,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 14:24:01,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 14:24:01,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 14:24:01,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 14:24:01,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 14:24:01,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 14:24:01,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 14:24:01,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 14:24:01,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 14:24:01,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 14:24:01,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 14:24:01,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 14:24:01,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 14:24:01,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 14:24:01,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 14:24:01,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 14:24:01,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 14:24:01,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 14:24:01,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 14:24:01,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 14:24:01,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 14:24:01,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 14:24:01,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 14:24:01,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 14:24:01,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 14:24:01,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 14:24:01,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 14:24:01,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 14:24:01,967 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-After.epf [2022-01-19 14:24:01,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 14:24:01,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 14:24:01,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 14:24:01,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 14:24:01,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 14:24:01,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 14:24:01,986 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 14:24:01,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 14:24:01,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 14:24:01,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 14:24:01,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 14:24:01,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 14:24:01,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 14:24:01,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 14:24:01,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 14:24:01,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 14:24:01,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 14:24:01,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 14:24:01,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 14:24:01,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 14:24:01,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 14:24:01,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 14:24:01,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 14:24:01,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:24:01,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 14:24:01,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 14:24:01,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 14:24:01,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 14:24:01,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 14:24:01,991 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 14:24:01,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 14:24:01,992 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 14:24:01,992 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 14:24:02,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 14:24:02,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 14:24:02,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 14:24:02,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 14:24:02,269 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 14:24:02,270 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 14:24:02,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1b2b14/fe86c6bfc2214b1aab1a8b0309b718d7/FLAGaae6591e7 [2022-01-19 14:24:02,723 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 14:24:02,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2022-01-19 14:24:02,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1b2b14/fe86c6bfc2214b1aab1a8b0309b718d7/FLAGaae6591e7 [2022-01-19 14:24:02,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1b2b14/fe86c6bfc2214b1aab1a8b0309b718d7 [2022-01-19 14:24:02,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 14:24:02,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 14:24:02,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 14:24:02,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 14:24:02,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 14:24:02,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:24:02" (1/1) ... [2022-01-19 14:24:02,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707354c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:02, skipping insertion in model container [2022-01-19 14:24:02,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:24:02" (1/1) ... [2022-01-19 14:24:02,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 14:24:02,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 14:24:02,946 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 14:24:02,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:24:02,959 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 14:24:02,985 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 14:24:02,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:24:03,000 INFO L208 MainTranslator]: Completed translation [2022-01-19 14:24:03,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03 WrapperNode [2022-01-19 14:24:03,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 14:24:03,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 14:24:03,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 14:24:03,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 14:24:03,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,042 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2022-01-19 14:24:03,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 14:24:03,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 14:24:03,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 14:24:03,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 14:24:03,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 14:24:03,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 14:24:03,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 14:24:03,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 14:24:03,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (1/1) ... [2022-01-19 14:24:03,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:24:03,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:24:03,120 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 14:24:03,135 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 14:24:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 14:24:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 14:24:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 14:24:03,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 14:24:03,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 14:24:03,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 14:24:03,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 14:24:03,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 14:24:03,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 14:24:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 14:24:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 14:24:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 14:24:03,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 14:24:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 14:24:03,158 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 14:24:03,235 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 14:24:03,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 14:24:03,632 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 14:24:03,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 14:24:03,789 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-19 14:24:03,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:24:03 BoogieIcfgContainer [2022-01-19 14:24:03,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 14:24:03,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 14:24:03,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 14:24:03,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 14:24:03,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:24:02" (1/3) ... [2022-01-19 14:24:03,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eebb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:24:03, skipping insertion in model container [2022-01-19 14:24:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:24:03" (2/3) ... [2022-01-19 14:24:03,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eebb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:24:03, skipping insertion in model container [2022-01-19 14:24:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:24:03" (3/3) ... [2022-01-19 14:24:03,802 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-01-19 14:24:03,807 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 14:24:03,807 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 14:24:03,807 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 14:24:03,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,863 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 14:24:03,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,863 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 14:24:03,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,864 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 14:24:03,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,865 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 14:24:03,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,869 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,870 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 14:24:03,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,871 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 14:24:03,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,872 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 14:24:03,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,872 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,872 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 14:24:03,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 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 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,878 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 14:24:03,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 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 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,880 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 14:24:03,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,881 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,882 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,883 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,885 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,889 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 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 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,890 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,891 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,891 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,891 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 14:24:03,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,892 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 14:24:03,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,892 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,893 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,893 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 14:24:03,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,894 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,898 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,899 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 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 14:24:03,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,900 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 14:24:03,901 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 14:24:03,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,901 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,902 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 14:24:03,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,903 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 14:24:03,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,903 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 14:24:03,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,904 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,905 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,905 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 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,907 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 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:24:03,912 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 14:24:03,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 14:24:03,971 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 14:24:03,972 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 14:24:03,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2022-01-19 14:24:04,134 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2022-01-19 14:24:04,134 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 14:24:04,139 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 14:24:04,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2022-01-19 14:24:04,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2022-01-19 14:24:04,206 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2022-01-19 14:24:04,207 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 14:24:04,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:04,208 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 14:24:04,209 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 14:24:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2022-01-19 14:24:04,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:04,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645049906] [2022-01-19 14:24:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:04,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:04,498 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 14:24:04,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645049906] [2022-01-19 14:24:04,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645049906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:04,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:04,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 14:24:04,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524545137] [2022-01-19 14:24:04,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:04,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 14:24:04,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 14:24:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 14:24:04,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2022-01-19 14:24:04,614 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 14:24:04,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:04,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2022-01-19 14:24:04,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:04,760 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2022-01-19 14:24:04,760 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-01-19 14:24:04,766 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 14:24:04,770 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2022-01-19 14:24:04,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2022-01-19 14:24:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 14:24:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 14:24:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2022-01-19 14:24:04,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2022-01-19 14:24:04,788 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2022-01-19 14:24:04,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2022-01-19 14:24:04,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:04,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2022-01-19 14:24:04,799 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 14:24:04,805 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 14:24:04,806 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 14:24:04,810 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2022-01-19 14:24:04,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2022-01-19 14:24:04,817 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 14:24:04,822 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2022-01-19 14:24:04,824 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 14:24:04,828 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2022-01-19 14:24:04,828 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2022-01-19 14:24:04,829 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 14:24:04,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:04,830 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 14:24:04,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 14:24:04,830 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 14:24:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2022-01-19 14:24:04,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:04,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823513438] [2022-01-19 14:24:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:04,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:05,258 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 14:24:05,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:05,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823513438] [2022-01-19 14:24:05,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823513438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:05,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:05,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 14:24:05,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462050499] [2022-01-19 14:24:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:05,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 14:24:05,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 14:24:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 14:24:05,263 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2022-01-19 14:24:05,264 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 14:24:05,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:05,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2022-01-19 14:24:05,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:05,471 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2022-01-19 14:24:05,472 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-01-19 14:24:05,473 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 14:24:05,476 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2022-01-19 14:24:05,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2022-01-19 14:24:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 14:24:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 14:24:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2022-01-19 14:24:05,479 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2022-01-19 14:24:05,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2022-01-19 14:24:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2022-01-19 14:24:05,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:05,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2022-01-19 14:24:05,482 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 14:24:05,485 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 14:24:05,486 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 14:24:05,486 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2022-01-19 14:24:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2022-01-19 14:24:05,488 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 14:24:05,492 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2022-01-19 14:24:05,492 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 14:24:05,493 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-01-19 14:24:05,493 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2022-01-19 14:24:05,494 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 14:24:05,494 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:05,494 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 14:24:05,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 14:24:05,494 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 14:24:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2022-01-19 14:24:05,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:05,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300618586] [2022-01-19 14:24:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:05,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:05,585 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 14:24:05,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:05,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300618586] [2022-01-19 14:24:05,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300618586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:05,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:05,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 14:24:05,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020582545] [2022-01-19 14:24:05,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:05,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 14:24:05,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:05,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 14:24:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 14:24:05,589 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-01-19 14:24:05,589 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 14:24:05,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:05,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-01-19 14:24:05,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:05,728 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2022-01-19 14:24:05,728 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2022-01-19 14:24:05,731 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 14:24:05,735 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2022-01-19 14:24:05,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2022-01-19 14:24:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 14:24:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 14:24:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2022-01-19 14:24:05,738 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2022-01-19 14:24:05,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2022-01-19 14:24:05,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2022-01-19 14:24:05,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:05,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2022-01-19 14:24:05,740 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 14:24:05,742 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 14:24:05,742 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 14:24:05,742 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2022-01-19 14:24:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2022-01-19 14:24:05,745 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 14:24:05,749 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2022-01-19 14:24:05,749 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 14:24:05,751 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2022-01-19 14:24:05,751 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2022-01-19 14:24:05,752 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 14:24:05,752 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:05,752 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 14:24:05,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 14:24:05,753 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 14:24:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2022-01-19 14:24:05,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:05,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208965331] [2022-01-19 14:24:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:05,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:05,856 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 14:24:05,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:05,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208965331] [2022-01-19 14:24:05,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208965331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:05,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:05,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 14:24:05,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231839089] [2022-01-19 14:24:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:05,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 14:24:05,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:05,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 14:24:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 14:24:05,863 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2022-01-19 14:24:05,864 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 14:24:05,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:05,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2022-01-19 14:24:05,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:05,985 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2022-01-19 14:24:05,986 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2022-01-19 14:24:05,988 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 14:24:05,991 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2022-01-19 14:24:05,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2022-01-19 14:24:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 14:24:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 14:24:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2022-01-19 14:24:05,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2022-01-19 14:24:05,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2022-01-19 14:24:05,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2022-01-19 14:24:05,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:05,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2022-01-19 14:24:05,995 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 14:24:05,996 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 14:24:05,997 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 14:24:05,997 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2022-01-19 14:24:05,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2022-01-19 14:24:05,999 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 14:24:06,002 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2022-01-19 14:24:06,002 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 14:24:06,004 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2022-01-19 14:24:06,004 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2022-01-19 14:24:06,005 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 14:24:06,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:06,005 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 14:24:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 14:24:06,005 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 14:24:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2022-01-19 14:24:06,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:06,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127578386] [2022-01-19 14:24:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:06,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:06,125 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 14:24:06,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:06,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127578386] [2022-01-19 14:24:06,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127578386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:06,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:06,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 14:24:06,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308072797] [2022-01-19 14:24:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:06,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 14:24:06,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 14:24:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 14:24:06,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-01-19 14:24:06,130 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 14:24:06,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:06,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-01-19 14:24:06,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:06,361 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2022-01-19 14:24:06,361 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2022-01-19 14:24:06,363 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 14:24:06,366 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2022-01-19 14:24:06,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2022-01-19 14:24:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2022-01-19 14:24:06,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2022-01-19 14:24:06,371 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2022-01-19 14:24:06,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2022-01-19 14:24:06,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:06,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2022-01-19 14:24:06,376 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 14:24:06,380 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 14:24:06,381 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 14:24:06,382 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2022-01-19 14:24:06,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2022-01-19 14:24:06,385 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 14:24:06,388 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2022-01-19 14:24:06,389 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 14:24:06,391 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2022-01-19 14:24:06,391 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2022-01-19 14:24:06,392 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 14:24:06,392 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:06,392 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 14:24:06,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 14:24:06,393 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 14:24:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2022-01-19 14:24:06,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:06,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453809076] [2022-01-19 14:24:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:06,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:06,501 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 14:24:06,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:06,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453809076] [2022-01-19 14:24:06,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453809076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:06,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:06,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 14:24:06,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995047345] [2022-01-19 14:24:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:06,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 14:24:06,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 14:24:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 14:24:06,505 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-01-19 14:24:06,506 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 14:24:06,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:06,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-01-19 14:24:06,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:06,783 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2022-01-19 14:24:06,783 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2022-01-19 14:24:06,786 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 14:24:06,790 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2022-01-19 14:24:06,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2022-01-19 14:24:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2022-01-19 14:24:06,794 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2022-01-19 14:24:06,794 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2022-01-19 14:24:06,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2022-01-19 14:24:06,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:06,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2022-01-19 14:24:06,798 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 14:24:06,803 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 14:24:06,804 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 14:24:06,804 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2022-01-19 14:24:06,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2022-01-19 14:24:06,808 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 14:24:06,812 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2022-01-19 14:24:06,812 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 14:24:06,815 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2022-01-19 14:24:06,815 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2022-01-19 14:24:06,815 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 14:24:06,816 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:06,816 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 14:24:06,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 14:24:06,816 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 14:24:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2022-01-19 14:24:06,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:06,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210376445] [2022-01-19 14:24:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:06,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:07,064 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 14:24:07,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210376445] [2022-01-19 14:24:07,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210376445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:07,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:07,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:24:07,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676094001] [2022-01-19 14:24:07,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:07,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:24:07,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:07,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:24:07,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:24:07,072 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-01-19 14:24:07,073 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 14:24:07,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:07,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-01-19 14:24:07,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:08,717 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2022-01-19 14:24:08,717 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2022-01-19 14:24:08,744 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 14:24:08,784 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2022-01-19 14:24:08,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2022-01-19 14:24:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-01-19 14:24:08,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2022-01-19 14:24:08,788 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2022-01-19 14:24:08,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2022-01-19 14:24:08,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:08,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2022-01-19 14:24:08,792 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 14:24:08,796 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 14:24:08,797 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 14:24:08,797 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2022-01-19 14:24:08,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2022-01-19 14:24:08,800 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 14:24:08,804 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2022-01-19 14:24:08,804 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 14:24:08,805 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2022-01-19 14:24:08,805 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2022-01-19 14:24:08,806 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 14:24:08,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:08,806 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 14:24:08,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 14:24:08,806 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 14:24:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2022-01-19 14:24:08,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:08,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335542330] [2022-01-19 14:24:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:08,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:09,029 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 14:24:09,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335542330] [2022-01-19 14:24:09,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335542330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:09,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:09,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:24:09,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000770651] [2022-01-19 14:24:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:09,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:24:09,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:24:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:24:09,034 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2022-01-19 14:24:09,035 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 14:24:09,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:09,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2022-01-19 14:24:09,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:10,279 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2022-01-19 14:24:10,279 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2022-01-19 14:24:10,299 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 14:24:10,321 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2022-01-19 14:24:10,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2022-01-19 14:24:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2022-01-19 14:24:10,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2022-01-19 14:24:10,325 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2022-01-19 14:24:10,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2022-01-19 14:24:10,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:10,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2022-01-19 14:24:10,329 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 14:24:10,332 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 14:24:10,334 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 14:24:10,334 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2022-01-19 14:24:10,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2022-01-19 14:24:10,341 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 14:24:10,344 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2022-01-19 14:24:10,345 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 14:24:10,347 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2022-01-19 14:24:10,347 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2022-01-19 14:24:10,348 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 14:24:10,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:10,348 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 14:24:10,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 14:24:10,348 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 14:24:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2022-01-19 14:24:10,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121127848] [2022-01-19 14:24:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:10,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:10,516 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 14:24:10,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121127848] [2022-01-19 14:24:10,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121127848] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:24:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433077808] [2022-01-19 14:24:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:10,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:24:10,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:24:10,519 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 14:24:10,527 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 14:24:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 14:24:10,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:24:11,356 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 14:24:11,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:24:11,902 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 14:24:11,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433077808] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:24:11,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:24:11,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2022-01-19 14:24:11,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888630978] [2022-01-19 14:24:11,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:11,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 14:24:11,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 14:24:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-01-19 14:24:11,906 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2022-01-19 14:24:11,908 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 14:24:11,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:11,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2022-01-19 14:24:11,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:13,305 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2022-01-19 14:24:13,305 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2022-01-19 14:24:13,332 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 14:24:13,372 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2022-01-19 14:24:13,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2022-01-19 14:24:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 14:24:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 14:24:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2022-01-19 14:24:13,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2022-01-19 14:24:13,399 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2022-01-19 14:24:13,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2022-01-19 14:24:13,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:13,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2022-01-19 14:24:13,420 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 14:24:13,439 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 14:24:13,441 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 14:24:13,442 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2022-01-19 14:24:13,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2022-01-19 14:24:13,457 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 14:24:13,461 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2022-01-19 14:24:13,462 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 14:24:13,463 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2022-01-19 14:24:13,463 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2022-01-19 14:24:13,463 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 14:24:13,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:13,464 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 14:24:13,492 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 14:24:13,692 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 14:24:13,693 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 14:24:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2022-01-19 14:24:13,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:13,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640240712] [2022-01-19 14:24:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:13,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:13,927 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 14:24:13,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640240712] [2022-01-19 14:24:13,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640240712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:13,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:13,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 14:24:13,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314476151] [2022-01-19 14:24:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:13,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 14:24:13,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 14:24:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 14:24:13,932 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-01-19 14:24:13,933 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 14:24:13,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:13,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-01-19 14:24:13,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:14,959 INFO L129 PetriNetUnfolder]: 2365/4801 cut-off events. [2022-01-19 14:24:14,959 INFO L130 PetriNetUnfolder]: For 9509/9509 co-relation queries the response was YES. [2022-01-19 14:24:14,994 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 14:24:15,028 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 116 selfloop transitions, 15 changer transitions 7/300 dead transitions. [2022-01-19 14:24:15,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 300 transitions, 1264 flow [2022-01-19 14:24:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1755 transitions. [2022-01-19 14:24:15,040 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2022-01-19 14:24:15,040 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1755 transitions. [2022-01-19 14:24:15,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1755 transitions. [2022-01-19 14:24:15,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:15,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1755 transitions. [2022-01-19 14:24:15,044 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 14:24:15,047 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 14:24:15,048 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 14:24:15,048 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1755 transitions. [2022-01-19 14:24:15,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 300 transitions, 1264 flow [2022-01-19 14:24:15,082 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 14:24:15,085 INFO L242 Difference]: Finished difference. Result has 272 places, 258 transitions, 798 flow [2022-01-19 14:24:15,086 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 14:24:15,086 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2022-01-19 14:24:15,086 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 258 transitions, 798 flow [2022-01-19 14:24:15,087 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 14:24:15,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:15,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, 1, 1, 1, 1, 1, 1, 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 14:24:15,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 14:24:15,087 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 14:24:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 195790739, now seen corresponding path program 1 times [2022-01-19 14:24:15,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98323072] [2022-01-19 14:24:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:15,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:15,195 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 14:24:15,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98323072] [2022-01-19 14:24:15,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98323072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:15,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:15,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 14:24:15,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002365230] [2022-01-19 14:24:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:15,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 14:24:15,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:15,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 14:24:15,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 14:24:15,199 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2022-01-19 14:24:15,200 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 14:24:15,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:15,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2022-01-19 14:24:15,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:15,617 INFO L129 PetriNetUnfolder]: 864/2281 cut-off events. [2022-01-19 14:24:15,617 INFO L130 PetriNetUnfolder]: For 5799/5850 co-relation queries the response was YES. [2022-01-19 14:24:15,631 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 14:24:15,646 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 63 selfloop transitions, 23 changer transitions 0/302 dead transitions. [2022-01-19 14:24:15,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 302 transitions, 1200 flow [2022-01-19 14:24:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 14:24:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 14:24:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2022-01-19 14:24:15,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2022-01-19 14:24:15,650 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2022-01-19 14:24:15,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2022-01-19 14:24:15,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:15,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2022-01-19 14:24:15,653 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 14:24:15,655 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 14:24:15,656 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 14:24:15,656 INFO L186 Difference]: Start difference. First operand has 272 places, 258 transitions, 798 flow. Second operand 6 states and 1425 transitions. [2022-01-19 14:24:15,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 302 transitions, 1200 flow [2022-01-19 14:24:15,664 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 14:24:15,667 INFO L242 Difference]: Finished difference. Result has 271 places, 270 transitions, 953 flow [2022-01-19 14:24:15,668 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 14:24:15,668 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 32 predicate places. [2022-01-19 14:24:15,668 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 953 flow [2022-01-19 14:24:15,669 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 14:24:15,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:15,669 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 14:24:15,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 14:24:15,670 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 14:24:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -514632839, now seen corresponding path program 1 times [2022-01-19 14:24:15,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:15,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336958522] [2022-01-19 14:24:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:15,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:15,794 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 14:24:15,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:15,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336958522] [2022-01-19 14:24:15,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336958522] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:24:15,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132373048] [2022-01-19 14:24:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:15,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:24:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:24:15,796 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 14:24:15,831 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 14:24:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:15,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 14:24:15,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:24:16,393 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 14:24:16,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:24:16,845 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 14:24:16,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132373048] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:24:16,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:24:16,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 11 [2022-01-19 14:24:16,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417220971] [2022-01-19 14:24:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:16,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 14:24:16,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 14:24:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 14:24:16,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-01-19 14:24:16,850 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 14:24:16,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:16,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-01-19 14:24:16,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:18,480 INFO L129 PetriNetUnfolder]: 4525/9682 cut-off events. [2022-01-19 14:24:18,480 INFO L130 PetriNetUnfolder]: For 45844/46244 co-relation queries the response was YES. [2022-01-19 14:24:18,529 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 14:24:18,584 INFO L132 encePairwiseOnDemand]: 253/265 looper letters, 150 selfloop transitions, 56 changer transitions 0/414 dead transitions. [2022-01-19 14:24:18,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 414 transitions, 2463 flow [2022-01-19 14:24:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 14:24:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 14:24:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2529 transitions. [2022-01-19 14:24:18,589 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8675814751286449 [2022-01-19 14:24:18,589 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2529 transitions. [2022-01-19 14:24:18,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2529 transitions. [2022-01-19 14:24:18,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:18,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2529 transitions. [2022-01-19 14:24:18,595 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 14:24:18,599 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 14:24:18,600 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 14:24:18,600 INFO L186 Difference]: Start difference. First operand has 271 places, 270 transitions, 953 flow. Second operand 11 states and 2529 transitions. [2022-01-19 14:24:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 414 transitions, 2463 flow [2022-01-19 14:24:18,689 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 14:24:18,693 INFO L242 Difference]: Finished difference. Result has 285 places, 309 transitions, 1456 flow [2022-01-19 14:24:18,694 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 14:24:18,694 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 46 predicate places. [2022-01-19 14:24:18,694 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 309 transitions, 1456 flow [2022-01-19 14:24:18,694 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 14:24:18,695 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:18,695 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 14:24:18,711 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 14:24:18,895 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 14:24:18,896 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 14:24:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 778151649, now seen corresponding path program 2 times [2022-01-19 14:24:18,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:18,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303319021] [2022-01-19 14:24:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:18,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:19,224 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 14:24:19,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:19,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303319021] [2022-01-19 14:24:19,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303319021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:24:19,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:24:19,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 14:24:19,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619479494] [2022-01-19 14:24:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:24:19,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 14:24:19,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 14:24:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 14:24:19,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2022-01-19 14:24:19,235 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 14:24:19,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:19,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2022-01-19 14:24:19,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:21,072 INFO L129 PetriNetUnfolder]: 7558/14275 cut-off events. [2022-01-19 14:24:21,072 INFO L130 PetriNetUnfolder]: For 59580/59619 co-relation queries the response was YES. [2022-01-19 14:24:21,161 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 14:24:21,252 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 219 selfloop transitions, 18 changer transitions 0/408 dead transitions. [2022-01-19 14:24:21,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 408 transitions, 2781 flow [2022-01-19 14:24:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:24:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:24:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2022-01-19 14:24:21,259 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2022-01-19 14:24:21,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2022-01-19 14:24:21,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2022-01-19 14:24:21,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:24:21,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2022-01-19 14:24:21,264 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 14:24:21,267 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 14:24:21,268 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 14:24:21,268 INFO L186 Difference]: Start difference. First operand has 285 places, 309 transitions, 1456 flow. Second operand 9 states and 1751 transitions. [2022-01-19 14:24:21,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 408 transitions, 2781 flow [2022-01-19 14:24:21,536 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 14:24:21,539 INFO L242 Difference]: Finished difference. Result has 293 places, 315 transitions, 1549 flow [2022-01-19 14:24:21,540 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 14:24:21,540 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 54 predicate places. [2022-01-19 14:24:21,541 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 315 transitions, 1549 flow [2022-01-19 14:24:21,541 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 14:24:21,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:24:21,541 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 14:24:21,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 14:24:21,541 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 14:24:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:24:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1347663800, now seen corresponding path program 1 times [2022-01-19 14:24:21,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:24:21,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928292588] [2022-01-19 14:24:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:21,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:24:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:24,149 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 14:24:24,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:24:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928292588] [2022-01-19 14:24:24,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928292588] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:24:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904024657] [2022-01-19 14:24:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:24:24,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:24:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:24:24,151 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 14:24:24,152 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 14:24:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:24:24,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-19 14:24:24,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:24:30,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 14:24:30,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 14:24:30,533 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-19 14:24:30,534 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 14:24:30,637 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 14:24:30,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:24:31,971 INFO L353 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2022-01-19 14:24:31,972 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 14:24:44,838 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 14:24:44,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904024657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:24:44,838 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:24:44,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 25] total 91 [2022-01-19 14:24:44,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741550787] [2022-01-19 14:24:44,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:24:44,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-19 14:24:44,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:24:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-19 14:24:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=6687, Unknown=0, NotChecked=0, Total=8190 [2022-01-19 14:24:44,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2022-01-19 14:24:44,858 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 14:24:44,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:24:44,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2022-01-19 14:24:44,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:24:52,830 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 14:24:52,830 INFO L384 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2022-01-19 14:24:52,830 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-01-19 14:24:52,830 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-01-19 14:24:52,830 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:53,726 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 14:24:53,726 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-01-19 14:24:53,726 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-01-19 14:24:53,726 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-01-19 14:24:53,726 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 14:24:56,487 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 14:24:56,487 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-01-19 14:24:56,488 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:56,488 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:56,488 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:24:57,438 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 14:24:57,439 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-01-19 14:24:57,439 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:24:57,439 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 14:24:57,439 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 14:24:58,497 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 14:24:58,497 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-01-19 14:24:58,498 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-01-19 14:24:58,498 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 14:24:58,498 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-01-19 14:24:59,648 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 14:24:59,649 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,649 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 14:24:59,649 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:59,649 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,650 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 14:24:59,650 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,650 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:24:59,650 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 14:24:59,650 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-01-19 14:25:00,567 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 14:25:00,567 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 14:25:00,567 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:00,567 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 14:25:00,567 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:00,568 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 14:25:00,568 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 14:25:00,568 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 14:25:00,569 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 14:25:00,569 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-01-19 14:25:00,584 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 14:25:00,584 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 14:25:00,585 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:00,585 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:00,585 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 14:25:01,482 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 14:25:01,482 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-01-19 14:25:01,482 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 14:25:01,482 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 14:25:01,482 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-01-19 14:25:01,483 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 14:25:01,483 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-01-19 14:25:01,483 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 14:25:01,483 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-01-19 14:25:01,483 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-01-19 14:25:02,410 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 14:25:02,410 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 14:25:02,410 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,411 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 14:25:02,411 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,411 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 14:25:02,411 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 14:25:02,411 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,411 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 14:25:02,411 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,412 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 14:25:02,412 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-01-19 14:25:02,412 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,412 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-01-19 14:25:02,412 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-01-19 14:25:03,143 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 14:25:03,143 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-01-19 14:25:03,143 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-01-19 14:25:03,143 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:03,144 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-01-19 14:25:03,150 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 14:25:03,151 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-01-19 14:25:03,151 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 14:25:03,151 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-01-19 14:25:03,151 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-01-19 14:25:03,569 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 14:25:03,569 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-01-19 14:25:03,569 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 14:25:03,569 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 14:25:03,569 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-01-19 14:25:04,117 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 14:25:04,117 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-01-19 14:25:04,117 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 14:25:04,117 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-01-19 14:25:04,117 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-01-19 14:25:04,629 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 14:25:04,630 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-01-19 14:25:04,630 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 14:25:04,630 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-01-19 14:25:04,630 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-01-19 14:25:05,306 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 14:25:05,307 INFO L384 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-01-19 14:25:05,307 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-01-19 14:25:05,307 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-01-19 14:25:05,307 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-01-19 14:25:05,769 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 14:25:05,769 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-01-19 14:25:05,769 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-01-19 14:25:05,770 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-01-19 14:25:05,770 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-01-19 14:25:06,096 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 14:25:06,096 INFO L384 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2022-01-19 14:25:06,096 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-01-19 14:25:06,097 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-01-19 14:25:06,097 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-01-19 14:25:06,673 INFO L129 PetriNetUnfolder]: 55321/103718 cut-off events. [2022-01-19 14:25:06,673 INFO L130 PetriNetUnfolder]: For 447193/449504 co-relation queries the response was YES. [2022-01-19 14:25:07,474 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 14:25:08,093 INFO L132 encePairwiseOnDemand]: 191/265 looper letters, 702 selfloop transitions, 535 changer transitions 12/1355 dead transitions. [2022-01-19 14:25:08,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1355 transitions, 10485 flow [2022-01-19 14:25:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-19 14:25:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2022-01-19 14:25:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 10794 transitions. [2022-01-19 14:25:08,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4333199518265757 [2022-01-19 14:25:08,112 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 10794 transitions. [2022-01-19 14:25:08,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 10794 transitions. [2022-01-19 14:25:08,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:25:08,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 10794 transitions. [2022-01-19 14:25:08,128 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 14:25:08,154 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 14:25:08,157 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 14:25:08,157 INFO L186 Difference]: Start difference. First operand has 293 places, 315 transitions, 1549 flow. Second operand 94 states and 10794 transitions. [2022-01-19 14:25:08,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1355 transitions, 10485 flow [2022-01-19 14:25:14,172 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 14:25:14,184 INFO L242 Difference]: Finished difference. Result has 442 places, 849 transitions, 8290 flow [2022-01-19 14:25:14,184 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 14:25:14,185 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 203 predicate places. [2022-01-19 14:25:14,185 INFO L470 AbstractCegarLoop]: Abstraction has has 442 places, 849 transitions, 8290 flow [2022-01-19 14:25:14,187 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 14:25:14,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:25:14,187 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 14:25:14,211 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 14:25:14,403 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 14:25:14,404 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 14:25:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:25:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash 996668130, now seen corresponding path program 2 times [2022-01-19 14:25:14,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:25:14,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567995932] [2022-01-19 14:25:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:25:14,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:25:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:25:18,613 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 14:25:18,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:25:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567995932] [2022-01-19 14:25:18,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567995932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:25:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701422018] [2022-01-19 14:25:18,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:25:18,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:25:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:25:18,615 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 14:25:18,616 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 14:25:18,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:25:18,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:25:18,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 143 conjunts are in the unsatisfiable core [2022-01-19 14:25:18,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:25:18,915 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 14:25:18,981 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 14:25:18,981 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 14:25:19,067 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-19 14:25:19,067 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 14:25:19,178 INFO L353 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-01-19 14:25:19,178 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 14:25:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:21,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:21,419 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 14:25:22,183 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 14:25:25,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:25,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:25,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:25,770 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 14:25:25,770 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 14:25:27,101 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 14:25:30,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:30,084 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 14:25:30,084 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 14:25:30,986 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 14:25:33,720 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 14:25:35,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:35,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:35,255 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 14:25:36,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:36,633 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 14:25:38,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:38,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:25:38,465 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 14:25:40,936 INFO L353 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-01-19 14:25:40,936 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 14:25:40,969 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 14:25:40,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:26:26,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 14:26:27,032 INFO L353 Elim1Store]: treesize reduction 63, result has 50.4 percent of original size [2022-01-19 14:26:27,032 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 14:26:27,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 14:26:27,385 INFO L353 Elim1Store]: treesize reduction 85, result has 72.5 percent of original size [2022-01-19 14:26:27,387 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 14:26:31,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:26:31,558 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 14:26:33,592 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:26:33,593 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 14:26:36,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:26:36,428 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:26:36,429 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 14:26:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:26:38,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:26:39,000 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 14:26:51,734 WARN L228 SmtUtils]: Spent 6.01s 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 14:27:10,563 WARN L228 SmtUtils]: Spent 7.20s 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 14:27:21,309 WARN L228 SmtUtils]: Spent 6.43s 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 14:27:34,470 WARN L228 SmtUtils]: Spent 6.76s 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 14:37:57,222 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 14:37:57,222 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 14:37:57,237 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-19 14:37:57,239 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 14:37:57,256 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 14:37:57,440 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 14:37:57,440 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 87ms.. [2022-01-19 14:37:57,441 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 14:37:57,441 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 14:37:57,441 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 14:37:57,441 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 14:37:57,444 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:37:57,445 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 14:37:57,446 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 14:37:57,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 02:37:57 BasicIcfg [2022-01-19 14:37:57,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 14:37:57,449 INFO L158 Benchmark]: Toolchain (without parser) took 834707.19ms. Allocated memory was 350.2MB in the beginning and 8.7GB in the end (delta: 8.3GB). Free memory was 293.2MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 6.6GB. Max. memory is 16.0GB. [2022-01-19 14:37:57,450 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 14:37:57,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.06ms. Allocated memory is still 350.2MB. Free memory was 293.1MB in the beginning and 317.1MB in the end (delta: -24.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.0GB. [2022-01-19 14:37:57,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.91ms. Allocated memory is still 350.2MB. Free memory was 317.1MB in the beginning and 314.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 14:37:57,450 INFO L158 Benchmark]: Boogie Preprocessor took 31.81ms. Allocated memory is still 350.2MB. Free memory was 313.8MB in the beginning and 311.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 14:37:57,450 INFO L158 Benchmark]: RCFGBuilder took 716.07ms. Allocated memory is still 350.2MB. Free memory was 311.7MB in the beginning and 267.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2022-01-19 14:37:57,451 INFO L158 Benchmark]: TraceAbstraction took 833654.94ms. Allocated memory was 350.2MB in the beginning and 8.7GB in the end (delta: 8.3GB). Free memory was 267.7MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 6.6GB. Max. memory is 16.0GB. [2022-01-19 14:37:57,452 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 350.2MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 257.06ms. Allocated memory is still 350.2MB. Free memory was 293.1MB in the beginning and 317.1MB in the end (delta: -24.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.91ms. Allocated memory is still 350.2MB. Free memory was 317.1MB in the beginning and 314.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.81ms. Allocated memory is still 350.2MB. Free memory was 313.8MB in the beginning and 311.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 716.07ms. Allocated memory is still 350.2MB. Free memory was 311.7MB in the beginning and 267.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 833654.94ms. Allocated memory was 350.2MB in the beginning and 8.7GB in the end (delta: 8.3GB). Free memory was 267.7MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 6.6GB. 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 87ms.. - 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 87ms.. - 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 87ms.. - 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 87ms.. - 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 87ms.. - 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: 833.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3437 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3437 mSDsluCounter, 4033 SdHoareTripleChecker+Invalid, 3.1s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1561 GetRequests, 1257 SyntacticMatches, 20 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13202 ImplicationChecksByTransitivity, 9.0s 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 26.7s 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